Average distance in graphs with removed elements

DOI10.1002/JGT.3190120309zbMATH Open0695.05032OpenAlexW2022880462MaRDI QIDQ3470488FDOQ3470488

Authors: Daniel Bienstock, Ervin Győri 

Publication date: 1988

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190120309

Recommendations

• Average distances in undirected graphs and the removal of vertices
• scientific article; zbMATH DE number 4123768
• scientific article; zbMATH DE number 4031733
• Average distance in weighted graphs with removed edges
• scientific article; zbMATH DE number 221409

zbMATH Keywords

connected graphaverage distance

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Cited In (15)

• Computing the average distance of an interval graph
• Title not available (Why is that?)
• Average distances in undirected graphs and the removal of vertices
• The average connectivity of a digraph
• Average distances and distance domination numbers
• Title not available (Why is that?)
• On mean distance and girth
• Mean distance in a tree
• Average distance in weighted graphs with removed edges
• Diameter and inverse degree
• Disproof of a conjecture about average Steiner distance.
• Average Distance and Edge-Connectivity I
• The average distance and the independence number
• On the non-commuting graph of dihedral group
• Title not available (Why is that?)

This page was built for publication: Average distance in graphs with removed elements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3470488)