Average distance and generalised packing in graphs
From MaRDI portal
Publication:708381
DOI10.1016/J.DISC.2010.05.006zbMATH Open1210.05108OpenAlexW2025240702MaRDI QIDQ708381FDOQ708381
Authors: 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
Recommendations
Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Wiener index of trees: Theory and applications
- On the sum of all distances in a graph or digraph
- Extremal values for ratios of distances in trees
- Relations between packing and covering numbers of a tree
- Average distance and independence number
- Average distance, minimum degree, and spanning trees
- The average distance and the independence number
- Title not available (Why is that?)
- Independence and average distance in graphs
- Spanning trees with many leaves and average distance
- Average distances in undirected graphs and the removal of vertices
- Average distance and domination number
- A note on dominating sets and average distance
- Average distances and distance domination numbers
Cited In (8)
- A GENERAL POSITION PROBLEM IN GRAPH THEORY
- Average eccentricity, \(k\)-packing and \(k\)-domination in graphs
- Wiener index of strong product of graphs
- Average distances and distance domination numbers
- On the average order of a dominating set of a forest
- Packing constants in graphs and connectivity
- Title not available (Why is that?)
- Average distance and domination number revisited
Uses Software
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)
