Another aspect of graph invariants depending on the path metric and an application in nanoscience
DOI10.1016/J.CAMWA.2010.08.042zbMATH Open1205.05232OpenAlexW1997381859WikidataQ61987794 ScholiaQ61987794MaRDI QIDQ623192FDOQ623192
H. Yousefi-Azari, M. H. Khalifeh, A. R. Ashrafi
Publication date: 13 February 2011
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2010.08.042
Applications of graph theory (05C90) Distance in graphs (05C12) Statistical mechanics of nanostructures and nanoparticles (82D80)
Cites Work
- Wiener index of hexagonal systems
- Title not available (Why is that?)
- Wiener index of trees: Theory and applications
- The first and second Zagreb indices of some graph operations
- Distance in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Calculating the edge Wiener and edge Szeged indices of graphs
- Some new results on distance-based graph invariants
- Relationship between the Hosoya polynomial and the hyper-Wiener index
- The hyper-Wiener index of graph operations
- A matrix method for computing Szeged and vertex PI indices of join and composition of graphs
- Generalized Wiener indices of zigzagging pentachains
- Title not available (Why is that?)
- An exact expression for the Wiener index of a \(TUC_{4}C_{8}(R)\) nanotorus
- Wiener number of hexagonal jagged-rectangles
- A Wiener-type graph invariant for some bipartite graphs
- A theorem on Wiener-type invariants for isometric subgraphs of hypercubes
- The Wiener number of the hexagonal net
Cited In (7)
- Topological indices of the subdivision of a family of partial cubes and computation of \(\mathrm{SiO}_2\) related structures
- Calculating the edge Wiener and edge Szeged indices of graphs
- Hyper-Wiener and Wiener polarity indices of silicate and oxide frameworks
- Vertex cut method for degree and distance-based topological indices and its applications to silicate networks
- Computation of isotopisms of algebras over finite fields by means of graph invariants
- Distance-based topological indices of the tree-like polyphenyl systems
- From graph theory to nano topology
Recommendations
This page was built for publication: Another aspect of graph invariants depending on the path metric and an application in nanoscience
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623192)
