No label defined (Q3680876)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3902706
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3902706 |
Statements
1984
0 references
self-centered graphs
0 references
eccentricity
0 references
equi-eccentric graphs
0 references
0.8290125727653503
0 references
[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.
0 references