Distances in benzenoid systems: Further developments

DOI10.1016/S0012-365X(98)00064-8zbMath0951.92033OpenAlexW1989250963MaRDI QIDQ1584454

Victor Chepoi, Sandi Klavžar

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00064-8

zbMATH Keywords

clustering algorithmWiener numberWiener indexmolecular graphsbenzenoid systemdistance properties

Mathematics Subject Classification ID

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

Related Items (5)

Algorithms for graphs of bounded treewidth via orthogonal range searching ⋮ A survey of the all-pairs shortest paths problem and its variants in graphs ⋮ Computing the Mostar index in networks with applications to molecular graphs ⋮ The Szeged index and the Wiener index of partial cubes with applications to chemical graphs ⋮ Distance distributions for graphs modeling computer networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On local convexity in graphs
• On bridged graphs and cop-win graphs
• Triangulating a simple polygon in linear time
• Bridged graphs are cop-win graphs: An algorithmic proof
• Cellular bipartite graphs
• On the complexity of recognizing Hamming graphs and related classes of graphs
• Fast Algorithms for Finding Nearest Common Ancestors
• Conditions for invariance of set diameters under d-convexification in a graph
• On Isometric Embeddings of Graphs
• Optimal Locations for a Class of Nonlinear, Single-Facility Location Problems on a Network

This page was built for publication: Distances in benzenoid systems: Further developments