Constructing uniform central graphs and embedding into them
From MaRDI portal
Recommendations
Cites work
- A proof of the conjecture regarding the sum of domination number and average eccentricity
- Almost self-centered graphs
- Almost self-centered median and chordal graphs
- Almost-peripheral graphs
- Computing the eccentricity distribution of large graphs
- Constructing almost peripheral and almost self-centered graphs revisited
- Construction of a family of uniform central graphs
- Eccentric graphs
- Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings
- Embedding graphs as isometric medians
- Further results regarding the sum of domination number and average eccentricity
- scientific article; zbMATH DE number 5844247 (Why is no real title available?)
- scientific article; zbMATH DE number 568786 (Why is no real title available?)
- scientific article; zbMATH DE number 1990714 (Why is no real title available?)
- scientific article; zbMATH DE number 1472150 (Why is no real title available?)
- Mean eccentricities of de Bruijn networks
- On a novel eccentricity-based invariant of a graph
- Remarks on the sum of squares of eccentricity of graphs
- Some edge-grafting transformations on the eccentricity resistance-distance sum and their applications
- Some notes on minimal self-centered graphs
- The average eccentricity of Sierpiński graphs
- Upper bounds on the average eccentricity
Cited in
(5)- Metric properties of Sierpiński triangle graphs
- Construction of a family of uniform central graphs
- scientific article; zbMATH DE number 1990714 (Why is no real title available?)
- scientific article; zbMATH DE number 1472150 (Why is no real title available?)
- On central-peripheral appendage numbers of uniform central graphs
This page was built for publication: Constructing uniform central graphs and embedding into them
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2283212)
