Results 101 to 110 of about 2,201 (118)
Some of the next articles are maybe not open access.
On adjacent-vertex-distinguishing total coloring of graphs
Science in China Series A, 2005In this paper, we present a new concept of the adjacent-vertex-distinguishing total coloring of graphs (briefly, AVDTC of graphs) and, meanwhile, have obtained the adjacent-vertex-distinguishing total chromatic number of some graphs such as cycle, complete graph, complete bipartite graph, fan, wheel and tree.
openaire +1 more source
The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
Journal of Combinatorial Optimization, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sun, Lin, Cheng, Xiaohan, Wu, Jianliang
openaire +1 more source
The Smarandachely Adjacent Vertex Distinguishing E-Total Coloring of some Join Graphs
Applied Mechanics and Materials, 2013Using 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.
Mu Chun Li, Shuang Li Wang, Li Li Wang
openaire +1 more source
The Smarandachely adjacent-vertex distinguishing total coloring of two kind of 3-regular graphs
2010 3rd International Conference on Biomedical Engineering and Informatics, 2010The Smarandachely adjacent-vertex distinguishing total coloring of graphs is a proper k-total coloring such that every adjacent vertex coloring set not embrace each other, the minimal number k is denoted the Smarandachely adjacent-vertex distinguishing total coloring chromatic number of graphs.
Jingwen Li +3 more
openaire +1 more source
Applied Mechanics and Materials, 2013
υυυ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.
Mu Chun Li, Li Zhang
openaire +1 more source
υυυ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.
Mu Chun Li, Li Zhang
openaire +1 more source
Advanced Materials Research, 2012
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.
Mu Chun Li, Li Zhang
openaire +1 more source
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.
Mu Chun Li, Li Zhang
openaire +1 more source
The Smarandachely adjacent vertex distinguishing E-total coloring of a number of 3-regular graphs
2013 2nd International Symposium on Instrumentation and Measurement, Sensor Network and Automation (IMSNA), 2013Application of analytic method and Constructing the Smarandachely adjacent vertex distinguishing E-total coloring function, the Smarandachely adjacent vertex distinguishing E-total coloring of two kinds of 3-regular graphs are mainly discussed, and the Smarandachely adjacent vertex distinguishing E-total chromatic number of join graph are obtained. The
Muchun Li, Shuangli Wang
openaire +1 more source
2007
The graph obtained by the famous Mycielski's construction is called the Mycielski graph. This paper focuses on the relation between the basic graphs and two classes of constructed graphs on the (adjacent) vertex-distinguishing total coloring. And some sufficient conditions with which the Mycielski graphs and the Cartesian product graphs satisfy the ...
Yanli Sun, Lei Sun
openaire +1 more source
The graph obtained by the famous Mycielski's construction is called the Mycielski graph. This paper focuses on the relation between the basic graphs and two classes of constructed graphs on the (adjacent) vertex-distinguishing total coloring. And some sufficient conditions with which the Mycielski graphs and the Cartesian product graphs satisfy the ...
Yanli Sun, Lei Sun
openaire +1 more source
Far East Journal of Mathematical Sciences (FJMS), 2019
R. Ezhilarasi, K. Thirusangu
openaire +1 more source
R. Ezhilarasi, K. Thirusangu
openaire +1 more source
A note on the adjacent vertex distinguishing total chromatic number of graphs
Discrete Mathematics, 2012Danjun Huang
exaly