Distance-Locally Disconnected Graphs
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...
Main Authors: | Miller Mirka, Ryan Joe, Ryjáček Zdeněk |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2013-03-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1657 |
Similar Items
-
On The Partition Dimension of Disconnected Graphs
by: Debi Oktia Haryeni, et al.
Published: (2017-06-01) -
Rainbow Disconnection in Graphs
by: Chartrand Gary, et al.
Published: (2018-11-01) -
The connected size Ramsey number for matchings versus small disconnected graphs
by: Hilda Assiyatun, et al.
Published: (2019-04-01) -
Disconnection in the Alexandroff duplicate
by: Papiya Bhattacharjee, et al.
Published: (2021-10-01) -
Totally disconnected compactifications
by: Parfeny P. Saworotnow
Published: (1993-01-01)