Neighbor sum distinguishing total colorings of planar graphs with maximum degree <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si17.gif" display="inline" overflow="scroll"><mml:mi>Δ</mml:mi></mml:math>

Cheng, Xiaohan; Huang, Danjun; Wang, Guanghui; Jian, Wu

doi:10.1016/j.dam.2015.03.013

Cited by 25 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A conjecture about it is put forward: the neighbor sum distinguishing the total coloration of any simple graph does not exceed its maximum degree plus 3. There are more kinds of literature related to neighbor sum distinguishing total coloring [4][5][6].…”

Section: For a Proper ]mentioning

confidence: 99%

Neighbor Sum Distinguishing Edge (Total) Coloring of Generalized Corona Product

Zhong

Tian

2022

J. Phys.: Conf. Ser.

View full text Add to dashboard Cite

The coloring theory of graphs is an important part of graph theory research. The key problem of the coloring theory of graphs is to determine the coloring number of each kind of coloring. Traditional coloring concepts mainly include proper vertex coloring, proper edge coloring, proper total coloring, and so on. In recent years, scholars at home and abroad have put forward some new coloring concepts, such as neighbor vertex distinguishing edge (total) coloring, and neighbor sum distinguishing edge (total) coloring, based on traditional coloring concepts and by adding other constraints. Some valuable results have been obtained, which further enrich the theory of graph coloring. For a proper [k]-edge coloring of a graph G, if for any adjacent vertex has a different sum of colors, then the coloring is a neighbor sum distinguishing [k]-edge coloring of G. For a proper [k]-total coloring of a graph G, if for any adjacent vertex has a different sum of colors, then the coloring is a neighbor sum distinguishing [k]-total coloring of G . In this paper, the coloring method and coloring index are determined by the process of induction and deduction and the construction of the dyeing method, and then the rationality of the method is verified by inverse proof and mathematical induction. If G is a simple graph with the order n ≥ 5 , and hn = (Hi ) i∈{1,2,…,n} is a sequence of disjoint simple graphs, where every Hi is a simple graph with the order m ≥ 7 . In this paper, we study the neighbor sum distinguishing edge(total) coloring of the generalized corona product G○hn of G and hn . The results are as follows: (1) If G is a path with order n , hn = (Hi ) i∈{1,2,…,n} is an alternating sequence of path and cycle with order m . If n is odd, we have χ Σ ′ ( G ∘ h n ) = m + 3 (2) If G is a path with order n , hn = (Hi ) i∈{1,2,…,n} is an alternating sequence of path and cycle with order m . If n is odd, we have χ Σ ′ ′ ( G ∘ h n ) = m + 4 Due to the late development of neighbor sum distinguishing edge (total) coloring of graphs, the related research results are relatively few. By studying the operation graph of a basic simple graph, we can provide the research basis and reference idea for the corresponding coloring of the general graph class. Therefore, it is of theoretical value to study the neighbor sum distinguishing edge (total) coloring problem of generalized corona products of graphs.

show abstract

Section: For a Proper ]mentioning

confidence: 99%

Neighbor Sum Distinguishing Edge (Total) Coloring of Generalized Corona Product

Zhong

Tian

2022

J. Phys.: Conf. Ser.

View full text Add to dashboard Cite

show abstract

“…proved that if G is a K 4 -minor free graph with (G) ≥ 4, then χ (G) ≤ (G) + 2. Later and Cheng et al (2015) considered the tnsd-k-coloring for planar graphs and proved the following theorems.…”

Section: Conjecture 12mentioning

confidence: 99%