نتایج جستجو برای: vertex equitable graph

تعداد نتایج: 222764  

2017

A square difference 3-equitable labeling of a graph G with vertex set V is a bijection f from V to {1, 2,.... | V | } jg such that if each edge uv is assigned the label -1 if |[f (u)]2 [f (v)]2 | = -1(mod 4), the label 0 if |[f (u)]2 [f (v)]2 | = 0(mod 4) and the label 1 if |[f (u)]2 [f (v)]| = 1(mod 4), then the number of edges labeled with i and the number of edges labelled with j differ by a...

2017

A square difference 3-equitable labeling of a graph G with vertex set V is a bijection f from V to {1, 2,.... | V | } jg such that if each edge uv is assigned the label -1 if |[f (u)]2 [f (v)]2 | = -1(mod 4), the label 0 if |[f (u)]2 [f (v)]2 | = 0(mod 4) and the label 1 if |[f (u)]2 [f (v)]| = 1(mod 4), then the number of edges labeled with i and the number of edges labelled with j differ by a...

2013
S. Murugesan D. Jayaraman

A 3-equitable prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, ..., |V |} such that if an edge uv is assigned the label 1 if gcd(f(u), f(v)) = 1 and gcd(f(u) + f(v), f(u)−f(v)) = 1, the label 2 if gcd(f(u), f(v)) = 1 and gcd(f(u) + f(v), f(u)− f(v)) = 2 and 0 otherwise, then the number of edges labeled with i and the number of edges labeled with j differ b...

2017

A square difference 3-equitable labeling of a graph G with vertex set V is a bijection f from V to {1, 2,.... | V | } jg such that if each edge uv is assigned the label -1 if |[f (u)]2 [f (v)]2 | = -1(mod 4), the label 0 if |[f (u)]2 [f (v)]2 | = 0(mod 4) and the label 1 if |[f (u)]2 [f (v)]| = 1(mod 4), then the number of edges labeled with i and the number of edges labelled with j differ by a...

Journal: :Combinatorica 2015
Hal A. Kierstead Alexandr V. Kostochka

Corrádi and Hajnal proved that for every k ≥ 1 and n ≥ 3k, every graph with minimum degree at least 2k contains k vertex-disjoint cycles. This implies that every 3kvertex graph with maximum degree at most k − 1 has an equitable k-coloring. We prove that for s ∈ {3, 4} if an sk-vertex graph G with maximum degree at most k has no equitable k-coloring, then G either contains Kk+1 or k is odd and G...

Journal: :Discrete Mathematics 2008
Jian-Liang Wu Ping Wang

A proper vertex coloring of a graph G is equitable if the size of color classes differ by at most one. The equitable chromatic threshold of G, denoted by ∗Eq(G), is the smallest integer m such that G is equitably n-colorable for all n m. We prove that ∗Eq(G) = (G) if G is a non-bipartite planar graph with girth 26 and (G) 2 or G is a 2-connected outerplanar graph with girth 4. © 2007 Elsevier B...

Journal: :Combinatorics, Probability & Computing 2003
Alexandr V. Kostochka Kittikorn Nakprasit

In many applications of graph colouring the sizes of colour classes should not be too large. For example, in scheduling jobs (some of which could be performed at the same time), it is not good if the resulting schedule requires many jobs to occur at some specific time. An application of this type is discussed in [8]. A possible formalization of this restriction is the notion of equitable colour...

2006
Hanna Furmańczyk

A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and denoted by χ=(G). It is interesting to note that if a graph G is equitably k-colorable, it does not imply that it is equitab...

2015
S K Vaidya N J Kothari

A subset D of ( ) V G is called an equitable dominating set if for every ( ) v V G D   there exists a vertex u D  such that ( ) uv E G  and | ( ) ( ) | 1 deg u deg v   . A subset D of ( ) V G is called an equitable independent set if for any , u D v   ( ) e N u for all { } v D u   . The concept of equi independent equitable domination is a combination of these two important concepts. ...

2013
Zena Coles Alana Huszar Jared Miller Zsuzsanna Szaniszlo

A tree is a vertex-edge graph that is connected and contains no cycles. A 4−equitable labeling of a graph is an assignment of labels {0, 1, 2, 3} to the vertices. The edge labels are the absolute difference of the labels of the vertices that they are incident to. The labels must be distributed as evenly as possible amongst the vertices and they must also be distributed as evenly as possible amo...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید