Geodesic
Graphs with the same peripheral and center eccentric vertices
Mathematica Bohemica, Tome 125 (2000) no. 3, pp. 331-339

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

MR Zbl
The eccentricity $e(v)$ of a vertex $v$ is the distance from $v$ to a vertex farthest from $v$, and $u$ is an eccentric vertex for $v$ if its distance from $v$ is $d(u,v) = e(v)$. A vertex of maximum eccentricity in a graph $G$ is called peripheral, and the set of all such vertices is the peripherian, denoted $\mathop PeriG)$. We use $\mathop Cep(G)$ to denote the set of eccentric vertices of vertices in $C(G)$. A graph $G$ is called an S-graph if $\mathop Cep(G) = \mathop Peri(G)$. In this paper we characterize S-graphs with diameters less or equal to four, give some constructions of S-graphs and investigate S-graphs with one central vertex. We also correct and generalize some results of F. Gliviak.
The eccentricity $e(v)$ of a vertex $v$ is the distance from $v$ to a vertex farthest from $v$, and $u$ is an eccentric vertex for $v$ if its distance from $v$ is $d(u,v) = e(v)$. A vertex of maximum eccentricity in a graph $G$ is called peripheral, and the set of all such vertices is the peripherian, denoted $\mathop PeriG)$. We use $\mathop Cep(G)$ to denote the set of eccentric vertices of vertices in $C(G)$. A graph $G$ is called an S-graph if $\mathop Cep(G) = \mathop Peri(G)$. In this paper we characterize S-graphs with diameters less or equal to four, give some constructions of S-graphs and investigate S-graphs with one central vertex. We also correct and generalize some results of F. Gliviak.
DOI : 10.21136/MB.2000.126124
Classification : 05C12, 05C20, 05C75
Keywords: graph; radius; diameter; center; eccentricity; distance 
Kyš, Peter. Graphs with the same peripheral and center eccentric vertices. Mathematica Bohemica, Tome 125 (2000) no. 3, pp. 331-339. doi: 10.21136/MB.2000.126124
@article{10_21136_MB_2000_126124,
     author = {Ky\v{s}, Peter},
     title = {Graphs with the same peripheral and center eccentric vertices},
     journal = {Mathematica Bohemica},
     pages = {331--339},
     year = {2000},
     volume = {125},
     number = {3},
     doi = {10.21136/MB.2000.126124},
     mrnumber = {1790124},
     zbl = {0963.05046},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/MB.2000.126124/}
}
TY  - JOUR
AU  - Kyš, Peter
TI  - Graphs with the same peripheral and center eccentric vertices
JO  - Mathematica Bohemica
PY  - 2000
SP  - 331
EP  - 339
VL  - 125
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/MB.2000.126124/
DO  - 10.21136/MB.2000.126124
LA  - en
ID  - 10_21136_MB_2000_126124
ER  - 
%0 Journal Article
%A Kyš, Peter
%T Graphs with the same peripheral and center eccentric vertices
%J Mathematica Bohemica
%D 2000
%P 331-339
%V 125
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/MB.2000.126124/
%R 10.21136/MB.2000.126124
%G en
%F 10_21136_MB_2000_126124

[1] Chаrtrаnd G., Lesniаk L.: Graphs and Digraphs. Wadsworth and Brooks, Monterey, California, 1986.

[2] Buckley F., Lewïnter M.: Minimal graph embeddings, eccentric vertices and the peripherian. Proc. Fifth Carribean Conference on Cornbinatorics and Computing. University of the West Indies, 1988, pp. 72-84.

[3] Buckley P., Lewinter M.: Graphs with all diametral paths through distant central vertices. Math. Comput. Modelling 17 (1993), 35-41. | DOI | MR

[4] Gliviаk F.: Two classes of graphs related to extrernal eccentricities. Math. Bohem. 122 (1997), 231-241. | MR

[5] Ore O.: Diameters in graphs. J.Combin.Theory 5 (1968), 75-81. | DOI | MR | Zbl

Cité par Sources :