The average eccentricity, spanning trees of plane graphs, size and order
From MaRDI portal
Publication:4576338
zbMATH Open1395.05049MaRDI QIDQ4576338FDOQ4576338
Authors: Patrick Ali, Peter Dankelmann, M. J. Morgan, Simon Mukwembi, H. C. Swart, Tomáš Vetrík
Publication date: 12 July 2018
Recommendations
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Connectivity (05C40)
Cited In (9)
- Average eccentricity, \(k\)-packing and \(k\)-domination in graphs
- The average eccentricity of Sierpiński graphs
- Average eccentricity, minimum degree and maximum degree in graphs
- Upper bounds on the average eccentricity of \(K_3\)-free and \(C_4\)-free graphs
- On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs
- The average eccentricity of a graph with prescribed girth
- Proximity in triangulations and quadrangulations
- Title not available (Why is that?)
- The average Steiner 3-eccentricity of block graphs
This page was built for publication: The average eccentricity, spanning trees of plane graphs, size and order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4576338)