Topological Properties and Computation of Silicate Networks Using Graph-Invariants

被引:0
|
作者
Chandrashekar, Kavitha Kolekar [1 ]
Srirangan, Jagatheswari [1 ]
机构
[1] Vellore Inst Technol, Sch Adv Sci, Dept Math, Vellore 632014, Tamil Nadu, India
关键词
SITE;
D O I
10.46793/match.93-2.463C
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
Silicon, oxygen and aluminium are found in large quantities on the earth's surface. Silicates are the minerals which contain silicon and oxygen in tetrahedral (SiO)4-4 units, which are linked together in several patterns. In chemical graph theory, atoms are represented as vertices and chemical bonds as edges. In a silicate network, a tetrahedron comprises of one central silicon atom and four surrounding oxygen atoms. Cement, ceramic and glass industries use silicates for manufacturing purposes. The computation of silicate networks using graph-invariant has been introduced in this article. Using graph-invariant parameters has applications in studying the topological properties of silicate networks. We consider chain silicate (CSm), cyclic silicate (CYSm), double chain silicate (DCSm), sheet silicate (SSm), honeycomb network (HCm) and m x m grid network (Gmxm). To compute the topological properties of silicate networks, we investigate the graph-invariants such as maximum cliques(omega ), minimum chromatic number(chi), maximum independence number(alpha), matching ratio(mr) and minimum domination number(gamma ). Here, we observe the clique number of chain silicate, cyclic silicate, double chain silicate, and sheet silicate is 3, whereas honeycomb network and m x m grid network is 2. Similarly, the chromatic number of chain silicate, cyclic silicate and sheet silicate is 4. Moreover, the chromatic number of the honeycomb network, m x m grid network is 2 and the double chain silicate is 4. Then, the independence number of chain silicate, cyclic silicate, double chain silicate and sheet silicate is m. These characteristics show the structural behaviour of silicate networks. For instance, the clique number gives the molecular structure of the silicate network whereas the chromatic number gives the least number of atom types necessary to represent a molecule.
引用
收藏
页数:310
相关论文
共 50 条
  • [31] Computation of topological indices of certain networks
    Hayat, Sakander
    Imran, Muhammad
    APPLIED MATHEMATICS AND COMPUTATION, 2014, 240 : 213 - 228
  • [32] Numerically accurate computation of the conditional trajectories of the topological invariants in turbulent flows
    Lozano-Duran, Adrian
    Holzner, Markus
    Jimenez, Javier
    JOURNAL OF COMPUTATIONAL PHYSICS, 2015, 295 : 805 - 814
  • [33] Computation in chemical graph rewriting networks
    Flamm, Christoph
    Merkle, Daniel
    Stadler, Peter F.
    JOURNAL OF PHYSICS-COMPLEXITY, 2025, 6 (01):
  • [34] Topological properties of sunscreens using mhr-polynomial of graph
    Jyothi, M. J.
    Shivashankara, K.
    EURASIAN CHEMICAL COMMUNICATIONS, 2022, 4 (05): : 402 - 410
  • [35] Using High-Bandwidth Networks Efficiently for Fast Graph Computation
    Cheng, Yongli
    Jiang, Hong
    Wang, Fang
    Hua, Yu
    Feng, Dan
    Guo, Wenzhong
    Wu, Yunxiang
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2019, 30 (05) : 1170 - 1183
  • [36] Generalized Reduction Constraints for the Global Optimization of Dynamic Process Networks using Topological Invariants
    Wartmann, Michael R.
    Heirung, Tor Aksel N.
    Ruiz, Juan P.
    Ydstie, B. Erik
    2010 AMERICAN CONTROL CONFERENCE, 2010, : 2823 - 2828
  • [37] Computation of isotopisms of algebras over finite fields by means of graph invariants
    Falcon, O. J.
    Falcon, R. M.
    Nunez, J.
    Pacheco, A. M.
    Villar, M. T.
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2017, 318 : 307 - 315
  • [38] Algorithm for faster computation of non-zero graph based invariants
    Hameed, Vazeerudeen Abdul
    Shamsuddin, Siti Mariyam
    Darus, Maslina
    Ralescu, Anca L.
    NEUROCOMPUTING, 2014, 137 : 96 - 106
  • [39] Computational and topological properties of neural networks by means of graph-theoretic parameters
    Khan, Asad
    Hayat, Sakander
    Zhong, Yubin
    Arif, Amina
    Zada, Laiq
    Fang, Meie
    ALEXANDRIA ENGINEERING JOURNAL, 2023, 66 : 957 - 977
  • [40] Networks Synchronizability, Local Dynamics and Some Graph Invariants
    Caneco, Acilina
    Fernandes, Sara
    Gracio, Clara
    Leonel Rocha, J.
    DYNAMICS, GAMES AND SCIENCE I, 2011, 1 : 221 - 238