Adjacent Vertex-Distinguishing E-Total Coloring on the Multiple Join Graph of Several Kinds of Particular Graphs

2012 ◽  
Vol 546-547 ◽  
pp. 489-494
Author(s):  
Mu Chun Li ◽  
Li Zhang
Keyword(s):  
Positive Integer ◽  
Chromatic Number ◽  
Simple Graph ◽  
Total Coloring ◽  
Adjacent Vertex ◽  
Total Chromatic Number ◽  
Join Graph ◽  
Uv C

Let G(V,E) be a simple graph, k be a positive integer, f be a mapping from V(G)E(G) to 1,2,...k. If uvE(G), we have f(u)≠f(v),f(u)≠f(uv) ,f(v)≠f(uv) ,C(u)≠C(v) , where C(u). Then f is called the adjacent vertex-distinguishing E-total coloring of G. The number is called the adjacent vertex –distinguishing E-total chromatic number of G. In this paper, the adjacent vertex –distinguishing E-total chromatic number of the multiple join graph of several kinds of particular graphs is discussed by using construct coloring function.

Adjacent Vertex-Distinguishing E-Total Coloring on the Multiple Join Graph of Complete Graph and Wheel

2013 ◽  
Vol 303-306 ◽  
pp. 1605-1608
Author(s):  
Mu Chun Li ◽  
Li Zhang
Keyword(s):  
Positive Integer ◽  
Chromatic Number ◽  
Complete Graph ◽  
Simple Graph ◽  
Total Coloring ◽  
Adjacent Vertex ◽  
Chromatic Numbers ◽  
Total Chromatic Number ◽  
Join Graph ◽  
Uv C

υυυLet G be a simple graph, k be a positive integer, f be a mapping from V(G)∪E(G) to {1,2,...,k} . If ∀uv∈E(G) , we have f(u)≠f(v) , f(u)≠f(uv),f(v)≠f(uv) , C(u)≠C(v), where C(u)={f(u)}∪{f(uv)|uv∈E(G)}. Then f is called the adjacent vertex distinguishing E-total coloring of G. The number is called the adjacent vertex –distinguishing E-total chromatic number of χSubscript text(G)=min{k|G has a k-AVDETC} . The adjacent vertex distinguishing E-total chromatic numbers of the multiple join graph of wheel and complete graph are obtained in this paper.

The Smarandachely Adjacent Vertex Distinguishing E-Total Coloring of some Join Graphs

2013 ◽  
Vol 475-476 ◽  
pp. 379-382
Author(s):  
Mu Chun Li ◽  
Shuang Li Wang ◽  
Li Li Wang
Keyword(s):  
Chromatic Number ◽  
Total Coloring ◽  
Adjacent Vertex ◽  
Analysis Method ◽  
Total Chromatic Number ◽  
Join Graph ◽  
Total Coloring Conjecture

Using the analysis method and the function of constructing the Smarandachely adjacent vertex distinguishing E-total coloring function, the Smarandachely adjacent vertex distinguishing E-total coloring of join graphs are mainly discussed, and the Smarandachely adjacent vertex distinguishing E-total chromatic number of join graph are obtained. The Smarandachely adjacent vertex distinguishing E-total coloring conjecture is further validated.

A Note on the Adjacent Vertex Distinguishing Total Chromatic Number of Graph

2011 ◽  
Vol 474-476 ◽  
pp. 2341-2345
Author(s):  
Zhi Wen Wang
Keyword(s):  
Chromatic Number ◽  
Maximum Degree ◽  
Simple Graph ◽  
Total Coloring ◽  
Adjacent Vertex ◽  
Total Chromatic Number ◽  
Parallel Graph ◽  
Total Coloring Conjecture

A total coloring of a simple graph G is called adjacent vertex distinguishing if for any two adjacent and distinct vertices u and v in G, the set of colors assigned to the vertices and the edges incident to u differs from the set of colors assigned to the vertices and the edges incident to v. In this paper we shall prove the series-parallel graph with maximum degree 3 and the series-parallel graph whose the number of edges is the double of maximum degree minus 1 satisfy the adjacent vertex distinguishing total coloring conjecture.

2-distance vertex-distinguishing total coloring of graphs

2018 ◽  
Vol 10 (02) ◽  
pp. 1850018
Author(s):  
Yafang Hu ◽  
Weifan Wang
Keyword(s):  
Chromatic Number ◽  
Maximum Degree ◽  
Simple Graph ◽  
Total Coloring ◽  
Total Chromatic Number ◽  
Minimum Number ◽  
Number Formula ◽  
Proper Total Coloring ◽  
Distance Formula

A [Formula: see text]-distance vertex-distinguishing total coloring of a graph [Formula: see text] is a proper total coloring of [Formula: see text] such that any pair of vertices at distance [Formula: see text] have distinct sets of colors. The [Formula: see text]-distance vertex-distinguishing total chromatic number [Formula: see text] of [Formula: see text] is the minimum number of colors needed for a [Formula: see text]-distance vertex-distinguishing total coloring of [Formula: see text]. In this paper, we determine the [Formula: see text]-distance vertex-distinguishing total chromatic number of some graphs such as paths, cycles, wheels, trees, unicycle graphs, [Formula: see text], and [Formula: see text]. We conjecture that every simple graph [Formula: see text] with maximum degree [Formula: see text] satisfies [Formula: see text].

Total coloring conjecture for vertex, edge and neighborhood corona products of graphs

2019 ◽  
Vol 11 (01) ◽  
pp. 1950014
Author(s):  
Radhakrishnan Vignesh ◽  
Jayabalan Geetha ◽  
Kanagasabapathi Somasundaram
Keyword(s):  
Chromatic Number ◽  
Maximum Degree ◽  
Simple Graph ◽  
Total Coloring ◽  
Tight Bound ◽  
Total Chromatic Number ◽  
Minimum Number ◽  
Total Coloring Conjecture

A total coloring of a graph [Formula: see text] is an assignment of colors to the elements of the graph [Formula: see text] such that no adjacent vertices and edges receive the same color. The total chromatic number of a graph [Formula: see text], denoted by [Formula: see text], is the minimum number of colors that suffice in a total coloring. Behzad and Vizing conjectured that for any simple graph [Formula: see text], [Formula: see text], where [Formula: see text] is the maximum degree of [Formula: see text]. In this paper, we prove the tight bound of the total coloring conjecture for the three types of corona products (vertex, edge and neighborhood) of graphs.

Coloring 3-power of 3-subdivision of subcubic graph

2018 ◽  
Vol 10 (03) ◽  
pp. 1850041 ◽  
Author(s):  
Fang Wang ◽  
Xiaoping Liu
Keyword(s):  
Positive Integer ◽  
Chromatic Number ◽  
London Math ◽  
Total Coloring ◽  
Total Graph ◽  
Total Chromatic Number ◽  
Subcubic Graph ◽  
Minimum Integer ◽  
Vertex Set ◽  
Number Formula

Let [Formula: see text] be a graph and [Formula: see text] be a positive integer. The [Formula: see text]-subdivision [Formula: see text] of [Formula: see text] is the graph obtained from [Formula: see text] by replacing each edge by a path of length [Formula: see text]. The [Formula: see text]-power [Formula: see text] of [Formula: see text] is the graph with vertex set [Formula: see text] in which two vertices [Formula: see text] and [Formula: see text] are adjacent if and only if the distance [Formula: see text] between [Formula: see text] and [Formula: see text] in [Formula: see text] is at most [Formula: see text]. Note that [Formula: see text] is the total graph [Formula: see text] of [Formula: see text]. The chromatic number [Formula: see text] of [Formula: see text] is the minimum integer [Formula: see text] for which [Formula: see text] has a proper [Formula: see text]-coloring. The total chromatic number of [Formula: see text], denoted by [Formula: see text], is the chromatic number of [Formula: see text]. Rosenfeld [On the total coloring of certain graphs, Israel J. Math. 9 (1971) 396–402] and independently, Vijayaditya [On total chromatic number of a graph, J. London Math. Soc. 2 (1971) 405–408] showed that for a subcubic graph [Formula: see text], [Formula: see text]. In this note, we prove that for a subcubic graph [Formula: see text], [Formula: see text].

Vertex-Distinguishing Total Coloring of Ladder Graphs (N=0(mod 8) )

2011 ◽  
Vol 225-226 ◽  
pp. 243-246
Author(s):  
Zhi Wen Wang
Keyword(s):  
Chromatic Number ◽  
Simple Graph ◽  
Total Coloring ◽  
Total Chromatic Number ◽  
Proper Total Coloring ◽  
Ladder Graphs

A proper total coloring of a simple graph G is called vertex distinguishing if for any two distinct vertices u and v in G, the set of colors assigned to the elements incident to u differs from the set of colors incident to v. The minimal number of colors required for a vertex distinguishing total coloring of G is called the vertex distinguishing total coloring chromatic number. In a paper, we give a “triangle compositor”, by the compositor, we proved that when n=0(mod 8) and , vertex distinguishing total chromatic number of “ladder graphs” is n.

scholarly journals Total Coloring Conjecture for Certain Classes of Graphs

Algorithms ◽  
2018 ◽  
Vol 11 (10) ◽  
pp. 161 ◽  
Author(s):  
R. Vignesh ◽  
J. Geetha ◽  
K. Somasundaram
Keyword(s):  
Chromatic Number ◽  
Maximum Degree ◽  
Line Graph ◽  
Product Line ◽  
Total Coloring ◽  
Lexicographic Product ◽  
Total Chromatic Number ◽  
Minimum Number ◽  
Total Coloring Conjecture

A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no two adjacent or incident elements receive the same color. The total chromatic number of a graph G, denoted by χ ′ ′ ( G ) , is the minimum number of colors that suffice in a total coloring. Behzad and Vizing conjectured that for any graph G, Δ ( G ) + 1 ≤ χ ′ ′ ( G ) ≤ Δ ( G ) + 2 , where Δ ( G ) is the maximum degree of G. In this paper, we prove the total coloring conjecture for certain classes of graphs of deleted lexicographic product, line graph and double graph.

Total colorings of circulant graphs

2020 ◽  
pp. 2150050
Author(s):  
J. Geetha ◽  
K. Somasundaram ◽  
Hung-Lin Fu
Keyword(s):  
Chromatic Number ◽  
Maximum Degree ◽  
Total Coloring ◽  
Circulant Graphs ◽  
Total Chromatic Number ◽  
Number Formula ◽  
Total Coloring Conjecture

The total chromatic number [Formula: see text] is the least number of colors needed to color the vertices and edges of a graph [Formula: see text] such that no incident or adjacent elements (vertices or edges) receive the same color. Behzad and Vizing proposed a well-known total coloring conjecture (TCC): [Formula: see text], where [Formula: see text] is the maximum degree of [Formula: see text]. For the powers of cycles, Campos and de Mello proposed the following conjecture: Let [Formula: see text] denote the graphs of powers of cycles of order [Formula: see text] and length [Formula: see text] with [Formula: see text]. Then, [Formula: see text] In this paper, we prove the Campos and de Mello’s conjecture for some classes of powers of cycles. Also, we prove the TCC for complement of powers of cycles.

Sign in / Sign up

Export Citation Format

Share Document