Strong Vertex-distinguishing Total Coloring Algorithm for Complete Graphs based on Equitable Coloring
نویسندگان
چکیده
منابع مشابه
Edge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملAdjacent vertex-distinguishing edge coloring of graphs
An adjacent vertex-distinguishing edge coloring, or avd-coloring, of a graph G is a proper edge coloring of G such that no pair of adjacent vertices meets the same set of colors. Let mad(G) and ∆(G) denote the maximum average degree and the maximum degree of a graph G, respectively. In this paper, we prove that every graph G with ∆(G) ≥ 5 and mad(G) < 3− 2 ∆ can be avd-colored with ∆(G) + 1 col...
متن کاملStrong parity vertex coloring of plane graphs
Czap and Jendrol’ introduced the notions of strong parity vertex coloring and the corresponding strong parity chromatic number χs. They conjectured that there is a constant bound K on χs for the class of 2-connected plane graphs. We prove that the conjecture is true with K = 97, even with an added restriction to proper colorings. Next, we provide simple examples showing that the sharp bound is ...
متن کاملTotal Coloring of Certain Double Vertex Graphs
In this paper we investigate the total coloring number for double vertex graphs of some of the most common classes of graphs. Mathematics Subject Classification: 05C15
متن کاملEquitable coloring of random graphs
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exists an equitable coloring of a graph G with k colors is said to be the equitable chromatic number of G and is denoted by χ=(G). The least positive integer k such that for any k′ ≥ k there exists an equitable coloring of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Engineering Science and Technology Review
سال: 2020
ISSN: 1791-9320,1791-2377
DOI: 10.25103/jestr.131.17