ADJACENT VERTEX-DISTINGUISHING TOTAL COLORING OF GENERAL MYCIELSKI OF $P_n$ AND $C_n$ [PDF]
International Journal of Pure and Apllied Mathematics, 2015 In this paper, we obtain the adjacent strong edge chromatic numbers of some General Mycielski Mn(G) (n ≥ 1) of special graphs G.
Z. Chuancheng +4 more
openaire +2 more sources
Adjacent vertex distinguishing total coloring of 3-degenerate graphs
arXiv.orgA total coloring of a simple undirected graph $G$ is an assignment of colors to its vertices and edges such that the colors given to the vertices form a proper vertex coloring, the colors given to the edges form a proper edge coloring, and the color of every edge is different from that of its two endpoints. That is, $ϕ:V(G)\cup E(G)\rightarrow\mathbb{N}
Behera, Diptimaya +2 more
openaire +3 more sources
Concise proofs for adjacent vertex-distinguishing total colorings
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
ADJACENT VERTEX DISTINGUISHING TOTAL COLORING OF GRAPHS WITH LOWER AVERAGE DEGREE
Taiwanese Journal of Mathematics, 2008 An adjacent vertex distinguishing total coloring of a graph $G$ is a proper total coloring of $G$ such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for an adjacent vertex distinguishing total coloring of $G$ is denoted by $\chi''_{a}(G)$.
Wang, Weifan, Wang, Yiqiao
openaire +3 more sources
Adjacent vertex distinguishing total colorings of 2-degenerate graphs
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhengke Miao +3 more
openaire +3 more sources
Adjacent Vertex Distinguishing Total Coloring of Line and Splitting Graph of Some Graphs
Annals of Pure and Applied Mathematics, 2017 K. Thirusangu, R. Ezhilarasi
openaire +2 more sources
Distinguishing colorings of graphs and their subgraphs [PDF]
, 2023 In this paper, several distinguishing colorings of graphs are studied, such as vertex distinguishing proper edge coloring, adjacent vertex distinguishing proper edge coloring, vertex distinguishing proper total coloring, adjacent vertex distinguishing ...
Baolin Ma, Chao Yang
core +1 more source
Smarandachely Adjacent Vertex Distinguishing Edge Coloring Algorithm of Graphs [PDF]
Jisuanji gongcheng, 2017 To solve the problem of Smarandachely Adjacent Vertex Distinguishing Edge Coloring(SAVDEC) of graphs,this paper presents a coloring algorithm based on multi-objective optimization.For each sub problem,the sub objective function vector and decision space ...
CAO Daotong,LI Jingwen,WEN Fei
doaj +1 more source
Neighbor Product Distinguishing Total Colorings of Planar Graphs with Maximum Degree at least Ten
Discussiones Mathematicae Graph Theory, 2021 A proper [k]-total coloring c of a graph G is a proper total coloring c of G using colors of the set [k] = {1, 2, . . . , k}. Let p(u) denote the product of the color on a vertex u and colors on all the edges incident with u.
Dong Aijun, Li Tong
doaj +1 more source
On the total and AVD-total coloring of graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A total coloring of a graph G is an assignment of colors to the vertices and the edges such that (i) no two adjacent vertices receive same color, (ii) no two adjacent edges receive same color, and (iii) if an edge e is incident on a vertex v, then v and ...
B. S. Panda, Shaily Verma, Yash Keerti
doaj +1 more source