Displaying similar documents to “Graphs which are edge-locally C n ”

Distance-Locally Disconnected Graphs

Mirka Miller, Joe Ryan, Zdeněk Ryjáček (2013)

Discussiones Mathematicae Graph Theory

Similarity:

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...