Geodesic
Two classes of graphs related to extremal eccentricities
Mathematica Bohemica, Tome 122 (1997) no. 3, pp. 231-241

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

MR Zbl
A graph $G$ is called an $S$-graph if its periphery $\mathop Peri(G)$ is equal to its center eccentric vertices $\mathop Cep(G)$. Further, a graph $G$ is called a $D$-graph if $\mathop Peri(G)\cap\mathop Cep(G)=\emptyset$. We describe $S$-graphs and $D$-graphs for small radius. Then, for a given graph $H$ and natural numbers $r\ge2$, $n\ge2$, we construct an $S$-graph of radius $r$ having $n$ central vertices and containing $H$ as an induced subgraph. We prove an analogous existence theorem for $D$-graphs, too. At the end, we give some properties of $S$-graphs and $D$-graphs.
A graph $G$ is called an $S$-graph if its periphery $\mathop Peri(G)$ is equal to its center eccentric vertices $\mathop Cep(G)$. Further, a graph $G$ is called a $D$-graph if $\mathop Peri(G)\cap\mathop Cep(G)=\emptyset$. We describe $S$-graphs and $D$-graphs for small radius. Then, for a given graph $H$ and natural numbers $r\ge2$, $n\ge2$, we construct an $S$-graph of radius $r$ having $n$ central vertices and containing $H$ as an induced subgraph. We prove an analogous existence theorem for $D$-graphs, too. At the end, we give some properties of $S$-graphs and $D$-graphs.
DOI : 10.21136/MB.1997.126153
Classification : 05C12, 05C35
Keywords: eccentricity; central vertex; peripheral vertex 
Gliviak, Ferdinand. Two classes of graphs related to extremal eccentricities. Mathematica Bohemica, Tome 122 (1997) no. 3, pp. 231-241. doi: 10.21136/MB.1997.126153
@article{10_21136_MB_1997_126153,
     author = {Gliviak, Ferdinand},
     title = {Two classes of graphs related to extremal eccentricities},
     journal = {Mathematica Bohemica},
     pages = {231--241},
     year = {1997},
     volume = {122},
     number = {3},
     doi = {10.21136/MB.1997.126153},
     mrnumber = {1600875},
     zbl = {0898.05021},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/MB.1997.126153/}
}
TY  - JOUR
AU  - Gliviak, Ferdinand
TI  - Two classes of graphs related to extremal eccentricities
JO  - Mathematica Bohemica
PY  - 1997
SP  - 231
EP  - 241
VL  - 122
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/MB.1997.126153/
DO  - 10.21136/MB.1997.126153
LA  - en
ID  - 10_21136_MB_1997_126153
ER  - 
%0 Journal Article
%A Gliviak, Ferdinand
%T Two classes of graphs related to extremal eccentricities
%J Mathematica Bohemica
%D 1997
%P 231-241
%V 122
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/MB.1997.126153/
%R 10.21136/MB.1997.126153
%G en
%F 10_21136_MB_1997_126153

[1] Buckley F., Harary F.: Distance in Graphs. Addison-Wesley, New York, 1990. | Zbl

[2] Buckley F., Lewinter M.: Graphs with diametral paths through distant central nodes. Math. Comput. Modelling 17 (1993), no. 11, 35-41. | DOI | MR

[3] Buckley F., Lewinter M.: Minimal graph embeddings, eccentric vertices and the peripherian. Proc. Fifth Caribbean Conference on Combinatorics and Computing. University of the West Indies, 1988, pp. 72-84.

[4] Gliviak F.: On radially critical graphs. Recent Advances in Graph Theory, Proc. Int. Symp. Prague 1974, Academia Press, Prague, 1975, pp. 207-221. | MR

[5] Lewinter M.: Graphs with special distance properties. Quo Vadis Graph Theory? (J. Gimbel, J.W. Kennedy and L. V. Quintas, eds.). Annals of Discrete Mathematics Vol. 55, Elsevier, Amsterdam, 89-92. | DOI | MR

Cité par Sources :