Displaying similar documents to “Biregular edge-symmetric graphs”

Supermagic Generalized Double Graphs 1

Jaroslav Ivančo (2016)

Discussiones Mathematicae Graph Theory

Similarity:

A graph G is called supermagic if it admits a labelling of the edges by pairwise di erent 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 will introduce some constructions of supermagic labellings of some graphs generalizing double graphs. Inter alia we show that the double graphs of regular Hamiltonian graphs and some circulant graphs are supermagic.

Sharp Upper Bounds for Generalized Edge-Connectivity of Product Graphs

Yuefang Sun (2016)

Discussiones Mathematicae Graph Theory

Similarity:

The generalized k-connectivity κk(G) of a graph G was introduced by Hager in 1985. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized k-edge-connectivity which is defined as λk(G) = min{λ(S) : S ⊆ V (G) and |S| = k}, where λ(S) denote the maximum number ℓ of pairwise edge-disjoint trees T1, T2, . . . , Tℓ in G such that S ⊆ V (Ti) for 1 ≤ i ≤ ℓ. In this paper, we study the generalized edge- connectivity of product graphs and obtain sharp...

More on even [a,b]-factors in graphs

Abdollah Khodkar, Rui Xu (2007)

Discussiones Mathematicae Graph Theory

Similarity:

In this note we give a characterization of the complete bipartite graphs which have an even (odd) [a,b]-factor. For general graphs we prove that an a-edge connected graph G with n vertices and with δ(G) ≥ max{a+1,an/(a+b) + a - 2} has an even [a,b]-factor, where a and b are even and 2 ≤ a ≤ b. With regard to the edge-connectivity this result is slightly better than one of the similar results obtained by Kouider and Vestergaard in 2004 and unlike their results, this result has no restriction...

A metric for graphs

Vladimír Baláž, Jaroslav Koča, Vladimír Kvasnička, Milan Sekanina (1986)

Časopis pro pěstování matematiky

Similarity:

Remarks on the existence of uniquely partitionable planar graphs

Mieczysław Borowiecki, Peter Mihók, Zsolt Tuza, M. Voigt (1999)

Discussiones Mathematicae Graph Theory

Similarity:

We consider the problem of the existence of uniquely partitionable planar graphs. We survey some recent results and we prove the nonexistence of uniquely (𝓓₁,𝓓₁)-partitionable planar graphs with respect to the property 𝓓₁ "to be a forest".

Dominant-matching graphs

Igor' E. Zverovich, Olga I. Zverovich (2004)

Discussiones Mathematicae Graph Theory

Similarity:

We introduce a new hereditary class of graphs, the dominant-matching graphs, and we characterize it in terms of forbidden induced subgraphs.