Average distance and generalised packing in graphs
From MaRDI portal
Publication:708381
Recommendations
Cites work
- scientific article; zbMATH DE number 4041962 (Why is no real title available?)
- A note on dominating sets and average distance
- Average distance and domination number
- Average distance and independence number
- Average distance, minimum degree, and spanning trees
- Average distances and distance domination numbers
- Average distances in undirected graphs and the removal of vertices
- Extremal values for ratios of distances in trees
- Independence and average distance in graphs
- On the sum of all distances in a graph or digraph
- Relations between packing and covering numbers of a tree
- Spanning trees with many leaves and average distance
- The average distance and the independence number
- Wiener index of trees: Theory and applications
Cited in
(8)- A general position problem in graph theory
- Average distance and domination number revisited
- Average eccentricity, \(k\)-packing and \(k\)-domination in graphs
- scientific article; zbMATH DE number 5130720 (Why is no real title available?)
- On the average order of a dominating set of a forest
- Packing constants in graphs and connectivity
- Wiener index of strong product of graphs
- Average distances and distance domination numbers
This page was built for publication: Average distance and generalised packing in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708381)