Grundy coloring of middle graph of wheel graph families
Künye
Maragatham, R. S. & Subramanian, A. (2023). Grundy coloring of middle graph of wheel graph families. TWMS Journal Of Applied And Engineering Mathematics, 13(3), 1190-1197.Özet
A Grundy k-coloring of a graph G is a proper k-coloring of vertices in G using colors {1, 2, · · · , k} such that for any two colors i and j, i < j, any vertex colored j is adjacent to some vertex colored i. The First-Fit or Grundy chromatic number (or simply Grundy number) of a graph G, denoted by ? (G), is the largest integer k, such that there exists a Grundy k-coloring for G. It can be easily seen that ? (G) equals to the maximum number of colors used by the greedy (or First-Fit) coloring of G [10]. In this paper, we obtain the Grundy chromatic number of middle graph of graph G, denoted by M (G), where G be a cycle or sunlet graph or star graph or wheel graph or helm graph.
Cilt
13Sayı
3Bağlantı
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/5615http://jaem.isikun.edu.tr/web/index.php/archive/121-vol13no3/1101
Koleksiyonlar
Aşağıdaki lisans dosyası bu öğe ile ilişkilidir:
İlgili Öğeler
Başlık, yazar, küratör ve konuya göre gösterilen ilgili öğeler.
-
Balanced rank distribution labeling of ladder graphs, complete graphs and complete bipartite graphs
Hemalatha, Palanisamy; Gokilamani, S. (Işık University Press, 2021)A balanced rank distribution labeling of a graph G of order n is a new kind of vertex labeling from {1, 2, 3, ..., k}(n <= k is an element of Z(+)) which leads to a balanced edge labeling of G called edge ranks. In this ... -
Hub-integrity of splitting graph and duplication of graph elements
Mahde, Sultan Senan; Mathad, Veena (Işık University Press, 2016-01-08)The hub-integrity of a graph G = (V (G), E(G)) is denoted as HI(G) and defined by HI(G) = min{|S| + m(G ? S), S is a hub set of G}, where m(G ? S) is the order of a maximum component of G ? S. In this paper, we discuss ... -
Distance spectra of some graph operations and some new distance equienergetic graphs of diameter 3
Adiga, Chandrashekar; Rakshith, B. R.; Sumithra (Işık University Press, 2019)Two graphs of same order are said to be distance equienergetic if their distance energies are same. In this paper, we first give a partial insight on the distance spectrum of Mycielskian graphs and then we focus on ...