scientific article; zbMATH DE number 3902706
From MaRDI portal
Publication:3680876
[For the entire collection see Zbl 0549.00001.] If every vertex v of a graph G has the same eccentricity \(e(v)=r\) then G is called r-equi-eccentric or self-centered of radius r. It is shown that the minimum number of edges in a 2-equi-eccentric graph of order p is 2p- 5. Along with several elementary results and constructions, the minimum 2-equi-eccentric graphs are characterized.
Recommendations
Cited in
(13)- Eccentric graphs
- Locally geodesic cycles in 2-self-centered graphs
- Hamiltonian and pancyclic graphs in the class of self-centered graphs with radius two
- A characterization for 2-self-centered graphs
- Almost self-centered graphs
- Graph energy based on the eccentricity matrix
- Spectral determinations and eccentricity matrix of graphs
- scientific article; zbMATH DE number 90428 (Why is no real title available?)
- scientific article; zbMATH DE number 175723 (Why is no real title available?)
- More on betweenness-uniform graphs.
- scientific article; zbMATH DE number 2191986 (Why is no real title available?)
- Determination of all graphs whose eccentric graphs are clusters
- New conditions for graph Hamiltonicity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3680876)