Vertex cut method for degree and distance-based topological indices and its applications to silicate networks

DOI10.1007/s10910-016-0646-3zbMath1349.92163OpenAlexW2406321670MaRDI QIDQ338824

S. Ruth Julie Kavitha, Krishnan Balasubramanian, Micheal Arockiaraj

Publication date: 7 November 2016

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-016-0646-3

zbMATH Keywords

Wiener indexSchultz indexGutman indexinorganic networks

Mathematics Subject Classification ID

Applications of graph theory (05C90) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (5)

Hyper-Wiener and Wiener polarity indices of silicate and oxide frameworks ⋮ Chromatic Schultz and Gutman polynomials of Jahangir graphs \(J_{2, m}\) and \(J_{3, m}\) ⋮ Partition distance in graphs ⋮ Valency-based topological descriptors of chemical networks and their applications ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computation of topological indices of certain networks
• Analytical expressions for Wiener indices of \(n\)-circumscribed peri-condensed benzenoid graphs
• Another aspect of graph invariants depending on the path metric and an application in nanoscience
• Isometric embedding in products of complete graphs
• On scale embeddings of graphs into hypercubes
• Clin d'oeil on \(L_1\)-embeddable planar graphs
• A note on \(l_ 1\)-rigid planar graphs
• Distance-preserving subgraphs of hypercubes

This page was built for publication: Vertex cut method for degree and distance-based topological indices and its applications to silicate networks