Average distance and domination number

DOI10.1016/S0166-218X(97)00067-XzbMath0888.05024MaRDI QIDQ1377614

Peter Dankelmann

Publication date: 26 January 1998

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

dominating setdomination numberaverage distance

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items (32)

A survey of the all-pairs shortest paths problem and its variants in graphs ⋮ Bounds on the sum of domination number and metric dimension of graphs ⋮ Wiener index of strong product of graphs ⋮ On the average Steiner distance of graphs with presribed properties ⋮ Relationships between some distance-based topological indices ⋮ Average distance, minimum degree, and spanning trees ⋮ The Wiener index of unicyclic graphs given number of pendant vertices or cut vertices ⋮ Extremal values on Zagreb indices of trees with given distance \(k\)-domination number ⋮ Extremal problems on the atom-bond sum-connectivity indices of trees with given matching number or domination number ⋮ On multiplicative sum Zagreb index of trees with fixed domination number ⋮ The minimum spectral radius of graphs with a given domination number ⋮ Comparative results and bounds for the eccentric-adjacency index ⋮ Average distance and connected domination ⋮ On distance spectral radius of graphs ⋮ On domination number and distance in graphs ⋮ Upper bounds on the average eccentricity ⋮ Unnamed Item ⋮ Average eccentricity, \(k\)-packing and \(k\)-domination in graphs ⋮ On extremal Zagreb indices of trees with given domination number ⋮ Unnamed Item ⋮ A note on the average distance of a Graph ⋮ On the Zagreb indices of graphs with given Roman domination number ⋮ A note on extremal trees with degree conditions ⋮ Average distance and generalised packing in graphs ⋮ Average distance and domination number revisited ⋮ Comparative study of distance-based graph invariants ⋮ A note on dominating sets and average distance ⋮ Average distances and distance domination numbers ⋮ On Sombor index of trees with fixed domination number ⋮ The minimum eccentric distance sum of trees with given distance k-domination number ⋮ Relations between degree-based graph invariants ⋮ Extremal trees for the general Randić index with a given domination number

Uses Software

• GRAFFITI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On graphs having domination number half their order
• Maximum number of edges in connected graphs with a given domination number
• Mean distance in a graph
• Average distance and independence number
• Computing the average distance of an interval graph
• On the average Steiner distance of graphs with presribed properties
• On the sum of all distances in a graph or digraph
• ON DISTANCES IN CHROMATIC GRAPHS
• The average distance and the independence number
• A lower bound on the average shortest path length in regular graphs
• Distance in graphs
• Maximum chromatic polynomials of 2‐connected graphs
• The average Steiner distance of a graph
• Domination critical graphs

This page was built for publication: Average distance and domination number