Distance property of chemical graphs
From MaRDI portal
Publication:5154525
Recommendations
- Topological based on distance indices of some chemical graphs
- Vertex cut method for degree and distance-based topological indices and its applications to silicate networks
- Distance-based topological indices of the tree-like polyphenyl systems
- Computing Szeged index of certain nanosheets using partition technique
- On some algorithms for computing topological indices of chemical graphs
Cites work
- Cacti with extremal PI index
- Complete characterization of bicyclic graphs with minimal Kirchhoff index
- Computation of topological indices of certain networks
- Extremal polyomino chains with respect to Zagreb indices
- scientific article; zbMATH DE number 687006 (Why is no real title available?)
- scientific article; zbMATH DE number 1049272 (Why is no real title available?)
- scientific article; zbMATH DE number 6161927 (Why is no real title available?)
- scientific article; zbMATH DE number 5259338 (Why is no real title available?)
- Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
- Multiplicative Zagreb indices of \(k\)-trees
- On a conjecture about the Szeged index
- On degree resistance distance of cacti
- On eccentric connectivity index
- On the revised Szeged index
- On topological indices of certain interconnection networks
- On topological indices of fullerenes
- On Zagreb indices, Zagreb polynomials of some nanostar dendrimers
- The eccentric connectivity index of TUC₄C₈(R) nanotubes
- Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges
- Use of the Szeged index and the revised Szeged index for measuring network bipartivity
- Vertex cut method for degree and distance-based topological indices and its applications to silicate networks
- Zagreb indices and multiplicative Zagreb indices of Eulerian graphs
Cited in
(6)- On degree-based topological indices of random polyomino chains
- Vertex cut method for degree and distance-based topological indices and its applications to silicate networks
- On some algorithms for computing topological indices of chemical graphs
- Topological based on distance indices of some chemical graphs
- Distance-based topological indices of the tree-like polyphenyl systems
- Zagreb connection indices on polyomino chains and random polyomino chains
This page was built for publication: Distance property of chemical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5154525)