On the adjacent vertex distinguishing edge chromatic number of graphs.
0
Citation
0
Reference
20
Related Paper
Keywords:
Brooks' theorem
Cite
Windmill graph
Edge contraction
Simple graph
Friendship graph
Edge Coloring
Cite
Citations (0)
A proper edge coloring of graph G is called equitable adjacent strong edge coloring if colored sets from every two adjacent vertices incident edge are different, and the number of edges in any two color classes differ by at most one, which the required minimum number of colors is called the adjacent strong equitable edge chromatic number. In this paper, we present the edge coloring of join-graphs about path and cycle, and gain the vertex-distinguishing edge chromatic number of ð‘ƒð‘š ∨ ð¶ð‘›.
Edge Coloring
Brooks' theorem
Fractional coloring
Graph Coloring
Cite
Citations (0)
Coloring problem is a classical difficult problem of graph theory. It is a fundamental problem in scientific computation and engineering design. In recent years, a variety of graph coloring problems frequently appeared and solved many problems in production. It is a difficult problem to discuss the chromatic number of a given graph class. In the paper, we introduce several kinds of chromatic numbers of graphs such as adjacent-vertex-distinguishing total chromatic number, adjacent-vertex-distinguishing proper edge chromatic number, smarandachely-adjacent-vertex-distinguishing edge chromatic number, and the multi-fan graphs are considered.
Windmill graph
Graph Coloring
Brooks' theorem
Edge Coloring
Cite
Citations (2)
It was proved that for any integer k≥2,there was a k+1-regular graph with vertex-distinguishing edge chromatic number 2k+1,and for any integer m≥4,there was a bipartite graph with vertex-distinguishing edge chromatic number m.
Windmill graph
Edge Coloring
Cite
Citations (0)
Direct product
Cite
Citations (0)
The vertex-distinguishing edge-coloring of F_m∨P_n are studied and vertex-distinguishing edge chromatic number of F_m∨P_n are obtained.
Cite
Citations (0)
The Adjacent-Vertex Distinguishing Edge Chromatic Number of Some Classes of Cartesian Product Graphs
Let G be a simple connected graph with ordr not less than 3,k-proper edge coloring of G is called adjacent-vertex distinguishing,if for arbitrary two adjacent vertices which are incident to different sets of colored edges.The minimum number required for an adjacent-vertex distinguishing edge coloring(AVDEC) of G is called the adjacent strong edge chromatic number.In this paper,we give two upper bounds of adjacent-vertex distinguishing edge chromatic number of Cartesian product graphs,and some results are obtained.
Cartesian product
Edge Coloring
Neighbourhood (mathematics)
Brooks' theorem
Simple graph
Cite
Citations (0)
Windmill graph
Cite
Citations (1)
The adjacent vertex-distinguishing edge chromatic number of join graph of circle and complete graph is obtained in this paper.
Cite
Citations (0)