Displaying similar documents to “Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II.”

Note on group distance magic complete bipartite graphs

Sylwia Cichacz (2014)

Open Mathematics

Similarity:

A Γ-distance magic labeling of a graph G = (V, E) with |V| = n is a bijection ℓ from V to an Abelian group Γ of order n such that the weight w ( x ) = ∑ y ∈ N G ( x ) ℓ ( y ) of every vertex x ∈ V is equal to the same element µ ∈ Γ, called the magic constant. A graph G is called a group distance magic graph if there exists a Γ-distance magic labeling for every Abelian group Γ of order |V(G)|. In this paper we give necessary and sufficient conditions for complete k-partite graphs of odd order p to be ℤp-distance magic....

ω -periodic graphs.

Benjamini, Itai, Hoffman, Christopher (2005)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A ramsey-type theorem for multiple disjoint copies of induced subgraphs

Tomoki Nakamigawa (2014)

Discussiones Mathematicae Graph Theory

Similarity:

Let k and ℓ be positive integers with ℓ ≤ k − 2. It is proved that there exists a positive integer c depending on k and ℓ such that every graph of order (2k−1−ℓ/k)n+c contains n vertex disjoint induced subgraphs, where these subgraphs are isomorphic to each other and they are isomorphic to one of four graphs: (1) a clique of order k, (2) an independent set of order k, (3) the join of a clique of order ℓ and an independent set of order k − ℓ, or (4) the union of an independent set of...

A Constructive Extension of the Characterization on PotentiallyK s , t -Bigraphic Pairs

Ji-Yun Guo, Jian-Hua Yin (2017)

Discussiones Mathematicae Graph Theory

Similarity:

Let Ks,t be the complete bipartite graph with partite sets of size s and t. Let L1 = ([a1, b1], . . . , [am, bm]) and L2 = ([c1, d1], . . . , [cn, dn]) be two sequences of intervals consisting of nonnegative integers with a1 ≥ a2 ≥ . . . ≥ am and c1 ≥ c2 ≥ . . . ≥ cn. We say that L = (L1; L2) is potentially Ks,t (resp. As,t)-bigraphic if there is a simple bipartite graph G with partite sets X = {x1, . . . , xm} and Y = {y1, . . . , yn} such that ai ≤ dG(xi) ≤ bi for 1 ≤ i ≤ m, ci ≤ dG(yi)...