Distance-Locally Disconnected Graphs
Discussiones Mathematicae Graph Theory, Tome 33 (2013) no. 1, p. 203.
Voir la notice de l'article dans European Digital Mathematics Library
For an integer k ≥ 1, we say that a (finite simple undirected) graph G is k-distance-locally disconnected, or simply k-locally disconnected if, for any x ∈ V (G), the set of vertices at distance at least 1 and at most k from x induces in G a disconnected graph. In this paper we study the asymptotic behavior of the number of edges of a k-locally disconnected graph on n vertices. For general graphs, we show that this number is Θ(n2) for any fixed value of k and, in the special case of regular graphs, we show that this asymptotic rate of growth cannot be achieved. For regular graphs, we give a general upper bound and we show its asymptotic sharpness for some values of k. We also discuss some connections with cages.
Classification :
05C12, 05C35, 05C40
Mots-clés : neighborhood, distance, locally disconnected, cage, neighborhood distance
Mots-clés : neighborhood, distance, locally disconnected, cage, neighborhood distance
@article{DMGT_2013__33_1_268130, author = {Mirka Miller and Joe Ryan and Zden\v{e}k Ryj\'a\v{c}ek}, title = {Distance-Locally {Disconnected} {Graphs}}, journal = {Discussiones Mathematicae Graph Theory}, pages = {203}, publisher = {mathdoc}, volume = {33}, number = {1}, year = {2013}, zbl = {1293.05168}, language = {en}, url = {https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_1_268130/} }
TY - JOUR AU - Mirka Miller AU - Joe Ryan AU - Zdeněk Ryjáček TI - Distance-Locally Disconnected Graphs JO - Discussiones Mathematicae Graph Theory PY - 2013 SP - 203 VL - 33 IS - 1 PB - mathdoc UR - https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_1_268130/ LA - en ID - DMGT_2013__33_1_268130 ER -
Mirka Miller; Joe Ryan; Zdeněk Ryjáček. Distance-Locally Disconnected Graphs. Discussiones Mathematicae Graph Theory, Tome 33 (2013) no. 1, p. 203. https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_1_268130/