Average distance and generalised packing in graphs

DOI10.1016/j.disc.2010.05.006zbMath1210.05108MaRDI QIDQ708381

Peter Dankelmann

Publication date: 11 October 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2010.05.006

zbMATH Keywords

packing number; average distance; distance-\(k\) domination

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C12: Distance in graphs

Related Items

Wiener index of strong product of graphs, A GENERAL POSITION PROBLEM IN GRAPH THEORY, Average eccentricity, \(k\)-packing and \(k\)-domination in graphs, Average distance and domination number revisited

Uses Software

• GRAFFITI

Cites Work

• Unnamed Item
• Unnamed Item
• Spanning trees with many leaves and average distance
• A note on dominating sets and average distance
• Average distances and distance domination numbers
• Relations between packing and covering numbers of a tree
• Average distances in undirected graphs and the removal of vertices
• Average distance and independence number
• Independence and average distance in graphs
• Average distance and domination number
• Extremal values for ratios of distances in trees
• On the sum of all distances in a graph or digraph
• The average distance and the independence number
• Wiener index of trees: Theory and applications