Some properties of locally homogeneous graphs.
Al-Addasi, Salah (2010)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
Al-Addasi, Salah (2010)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
Ľubomír Šoltés (1992)
Mathematica Slovaca
Similarity:
Ľubomír Šoltés (1990)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
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...
Jaroslav Ivančo, Tatiana Polláková (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we establish some conditions for graphs with a saturated vertex to be supermagic. Inter alia we show that complete multipartite graphs K1,n,n and K1,2,...,2 are supermagic.