Let k ≥ 2 be an integer and G be a connected graph of order at least 3. A twin k-edge coloring of G is a proper edge coloring of G that uses colors from ℤ k and that induces a proper vertex coloring on G where the color of a vertex v is the sum (in ℤ k ) of the colors of the edges incident with v. The smallest integer k for which G has a twin k-edge coloring is the twin chromatic index of G and is denoted by χ t ′ ( G ) . In this paper, we determine the twin chromatic indices of circulant graphs C n ( 1 , n 2 ) , and some generalized Petersen graphs such as GP(3s, k), GP(m, 2), and GP(4s, l) where n ≥ 6 and n ≡ 0 (mod 4), s ≥ 1, k ≢ 0 (mod 3), m ≥ 3 and m ∉ {4, 5}, and l is odd. Moreover, we provide some sufficient conditions for a connected graph with maximum degree 3 to have twin chromatic index greater than 3.
Let c : V(G) → ℕ be a coloring of the vertices in a graph G. For a vertex u in G, the color sum of u, denoted by σ(u), is the sum of the colors of the neighbors of u. The coloring c is called a sigma coloring of G if σ(u) ≠ σ(v) whenever u and v are adjacent vertices in G. The minimum number of colors that can be used in a sigma coloring of G is called the sigma chromatic number of G and is denoted by σ(G). Given two simple, connected graphs G and H, the corona of G and H, denoted by G ⊙ H, is the graph obtained by taking one copy of G and |V(G)| copies of H and where the ith vertex of G is adjacent to every vertex of the ith copy of H. In this study, we will show that for a graph G with |V(G)| ≥ 2, and a complete graph Kn of order n, n ≤ σ(G ⊙ Kn ) ≤ max {σ(G), n}. In addition, let Pn and Cn denote a path and a cycle of order n respectively. If m, n ≥ 3, we will prove that σ(Km ⊙ Pn ) = 2 if and only if m ≤ n − 2 ⌊ n 4 ⌋ + 2 . If n is even, we show that σ(Km ⊙ Cn ) = 2 if and only if m ≤ n − 2 ⌈ n 4 ⌉ + 2 . Furthermore, in the case that n is odd, we show that σ(Km ⊙ Cn ) = 3 if and only if m ≤ H ( ⌈ n 4 ⌉ − 1 , n − ⌈ n 4 ⌉ ) where H(r, s) denotes the number of lattice points in the convex hull of points on the plane determined by the integer parameters r and s.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.