Generalized eccentricity, radius, and diameter in graphs
From MaRDI portal
Publication:4934876
DOI10.1002/(SICI)1097-0037(199912)34:4%3C312::AID-NET11%3E3.0.CO;2-VzbMATH Open0946.05037OpenAlexW2029961785MaRDI QIDQ4934876FDOQ4934876
Authors: Peter Dankelmann, Wayne Goddard, Michael A. Henning, H. C. Swart
Publication date: 23 October 2000
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199912)34:4%3C312::aid-net11%3E3.0.co;2-v
Recommendations
Cites Work
Cited In (9)
- Average eccentricity, \(k\)-packing and \(k\)-domination in graphs
- Some properties of the \((k,l)\)-radius
- On \((k,l)\)-radius of random graphs
- \(Mn\)-polynomials of theta and Wagner graphs
- Distance between two \(k\)-sets and path-systems extendibility.
- Title not available (Why is that?)
- On \((k,l)\)-radii of wheels
- Edge restricted detour index of some graphs
- Distance domination and generalized eccentricity in graphs with given minimum degree
This page was built for publication: Generalized eccentricity, radius, and diameter in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934876)