Average distances and distance domination numbers

DOI10.1016/j.dam.2008.03.024zbMath1169.05318OpenAlexW2150551524MaRDI QIDQ1028442

Fang Tian, Jun-Ming Xu

Publication date: 30 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.dam.2008.03.024

zbMATH Keywords

distancediameterdomination numberaverage distancedistance domination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Counting the Numbers of Paths of All Lengths in Symmetric Dendrimers and Its Applications ⋮ Extremal values on Zagreb indices of trees with given distance \(k\)-domination number ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Average eccentricity, \(k\)-packing and \(k\)-domination in graphs ⋮ A note on extremal trees with degree conditions ⋮ Average distance and generalised packing in graphs ⋮ Average distance and domination number revisited ⋮ Distance Domination in Graphs ⋮ The minimum eccentric distance sum of trees with given distance k-domination number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relations between packing and covering numbers of a tree
• Average distance and independence number
• Independence and average distance in graphs
• Average distance and domination number
• On forwarding indices of networks
• Using minimum degree to bound average distance
• The forwarding index of communication networks
• On the sum of all distances in a graph or digraph
• Average distance in graphs with removed elements
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• Maximum chromatic polynomials of 2‐connected graphs
• Theory and Application of Graphs