Results 1 to 10 of about 112 (91)

Adjacent vertex distinguishing total coloring of the corona product of graphs

Discussiones Mathematicae Graph Theory
Summary: An adjacent vertex distinguishing (AVD-)total coloring of a simple graph \(G\) is a proper total coloring of \(G\) such that for any pair of adjacent vertices \(u\) and \(v\), we have \(C(u)\neq C(v)\), where \(C(u)\) is the set of colors given to vertex \(u\) and the edges incident to \(u\) for \(u\in V(G)\). The AVD-total chromatic number, \(
Shaily Verma, B. S. Panda
doaj   +3 more sources

Adjacent vertex strongly distinguishing total coloring of graphs with lower average degree

Discussiones Mathematicae Graph Theory
Summary: An adjacent vertex strongly distinguishing total-coloring of a graph \(G\) is a proper total-coloring such that no two adjacent vertices meet the same color set, where the color set of a vertex consists of all colors assigned on the vertex and its incident edges and neighbors. The minimum number of the colors required is called adjacent vertex
Fei Wen, Li Zhou, Zepeng Li
doaj   +3 more sources

Adjacent Vertex Distinguishing Coloring of Fuzzy Graphs

Mathematics, 2023
In this paper, we consider the adjacent vertex distinguishing proper edge coloring (for short, AVDPEC) and the adjacent vertex distinguishing total coloring (for short, AVDTC) of a fuzzy graph.
Zengtai Gong, Chen Zhang
doaj   +1 more source

Adjacent vertex distinguishing total coloring of corona products (Brief Announcement)

Procedia Computer Science, 2023
An adjacent vertex distinguishing total k-coloring f of a graph G is a proper total k-coloring of G such that no pair of adjacent vertices has the same color sets. In 2005 Zhang et al. posted the conjecture (AVDTCC) that every simple graph G has adjacent vertex distinguishing total (∆(G) + 3)-coloring.
Hanna Furmańczyk, Rita Zuazua
openaire   +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

Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs

Numerical Algebra, Control & Optimization, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tian, Shuangliang, Chen, Ping, Shao, Yabin, Wang, Qian   +3 more
  +6 more sources

Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs

Discussiones Mathematicae Graph Theory, 2020
Two distinct crossings are independent if the end-vertices of the crossed pair of edges are mutually different. If a graph G has a drawing in the plane such that every two crossings are independent, then we call G a plane graph with independent crossings
Song Wen-Yao, Miao Lian-Ying, Duan Yuan-Yuan   +2 more
doaj   +1 more source

Cartesian积与邻点可区别着色之间的关系(Relation between Cartesian product and adjacent vertex distinguishing coloring)

Zhejiang Daxue xuebao. Lixue ban, 2017
A proper k-edge coloring of a graph G is an assignment of k colors 1, 2, …, k to edges of G such that any two adjacent edges receive the different colors.
WANGGuoxing(王国兴)
doaj   +1 more source