A Wiener-type graph invariant for some bipartite graphs

DOI10.1016/0893-9659(95)00067-ZzbMath0839.05037OpenAlexW2067310719MaRDI QIDQ1904516

Ivan Gutman, Andrey A. Dobrynin, Gyula Dömötör

Publication date: 20 December 1995

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(95)00067-z

zbMATH Keywords

distancesbipartite graphsWiener number

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (6)

The Szeged and the Wiener index of graphs ⋮ Another aspect of graph invariants depending on the path metric and an application in nanoscience ⋮ Some new results on distance-based graph invariants ⋮ New distance-based graph invariants and relations among them ⋮ Cluj polynomials ⋮ Unnamed Item

Cites Work

• Eigenvalues, diameter, and mean distance in graphs
• Computing the average distance of an interval graph
• Mean distance in a tree
• On the sum of all distances in a graph or digraph
• Distance in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Wiener-type graph invariant for some bipartite graphs