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 条
  • [41] Spectral Invariants and Some Stable Properties of a Graph
    Yu, Guidong
    Li, Rao
    Xing, Baohua
    ARS COMBINATORIA, 2015, 121 : 33 - 46
  • [42] Wiener-type Invariants on Graph Properties
    Zhou, Qiannan
    Wang, Ligong
    Lu, Yong
    FILOMAT, 2018, 32 (02) : 489 - 502
  • [43] Deep Graph Spectral Evolution Networks for Graph Topological Evolution
    Etemadyrad, Negar
    Li, Qingzhe
    Zhao, Liang
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 7358 - 7366
  • [44] Neural computation, social networks, and topological spectra
    Diligenti, M
    Gori, M
    Maggini, M
    THEORETICAL COMPUTER SCIENCE, 2004, 320 (01) : 71 - 87
  • [45] On Computation and Analysis of Topological Index-Based Invariants for Complex Coronoid Systems
    Rashid M.A.
    Ahmad S.
    Siddiqui M.K.
    Kaabar M.K.A.
    Complexity, 2021, 2021
  • [46] On Analysis and Computation of Degree-Based Topological Invariants for Cyclic Mesh Network
    Zahra, Nida
    Ibrahim, Muhammad
    Siddiqui, Muhammad Kamran
    Shooshtri, Hajar
    JOURNAL OF CHEMISTRY, 2021, 2021
  • [47] On computation of M-polynomial and topological indices of starphene graph
    Chaudhry, Faryal
    Ehsan, Muhammad
    Afzal, Deeba
    Farahani, Mohammad Reza
    Cancan, Murat
    Ediz, Suleyman
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2021, 24 (02): : 401 - 414
  • [48] COMPUTATION OF TOPOLOGICAL INDICES OF INTERSECTION GRAPHS AND CONCENTRIC WHEELS GRAPH
    Alaeiyan, Mehdi
    Mojarad, Rasoul
    Asadpour, Jafar
    PROCEEDINGS OF THE ROMANIAN ACADEMY SERIES A-MATHEMATICS PHYSICS TECHNICAL SCIENCES INFORMATION SCIENCE, 2012, 13 (03): : 183 - 190
  • [49] Application of Graph Theory to the Computation of Hydrocarbon Topological Indices: Ketone
    Jaina, Pranavi
    Suresh, Koppula
    Vijayasekhar, J.
    IMPENDING INQUISITIONS IN HUMANITIES AND SCIENCES, ICIIHS-2022, 2024, : 242 - 245
  • [50] USING SYMBOLIC COMPUTATION TO FIND ALGEBRAIC INVARIANTS
    KEREN, D
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1994, 16 (11) : 1143 - 1149