Average distances in undirected graphs and the removal of vertices
From MaRDI portal
Publication:1263601
DOI10.1016/0095-8956(90)90136-NzbMath0688.05045OpenAlexW2014714030MaRDI QIDQ1263601
Publication date: 1990
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(90)90136-n
Related Items (12)
Computing the average distance of an interval graph ⋮ Ordering the non-starlike trees with large reverse wiener indices ⋮ Wiener index of graphs with fixed number of pendant or cut-vertices ⋮ Wiener number of vertex-weighted graphs and a chemical application ⋮ Unnamed Item ⋮ Wiener index of sum of shadowgraphs ⋮ New composition of graphs and their Wiener indices ⋮ The \(\rho\)-moments of vertex-weighted graphs ⋮ The hyper-Wiener index of the generalized hierarchical product of graphs ⋮ Average distance and generalised packing in graphs ⋮ On the non-commuting graph of dihedral group ⋮ Four new sums of graphs and their Wiener indices
Cites Work
This page was built for publication: Average distances in undirected graphs and the removal of vertices
