Graphs which are edge-locally $C_n$

Roman Nedela

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “Graphs which are edge-locally $C_{n}$ ”

Polytopic locally linear graphs

Bohdan Zelinka (1988)

Mathematica Slovaca

Similarity:

e-locally acyclic graphs

D. Fronček (1991)

Applicationes Mathematicae

Similarity:

Locally path-like graphs

Dalibor Fronček (1989)

Časopis pro pěstování matematiky

Similarity:

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

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

Polytopic locally linear graphs

e-locally acyclic graphs

Locally path-like graphs

Distance-Locally Disconnected Graphs

Displaying similar documents to “Graphs which are edge-locally $C_{n}$ ”