On the injective chromatic number of splitting graph and shadow graph of certain regular and biregular graphs
Künye
C. K., B. & M. S., S. (2025). On the injective chromatic number of splitting graph and shadow graph of certain regular and biregular graphs. TWMS Journal of Applied and Engineering Mathematics, 15(1), 79-88.Özet
The injective chromatic number of a graph G, denoted by χi(G) is the minimum number of colors needed to color the vertices of G such that two vertices with a common neighbor are assigned distinct colors. The splitting graph and shadow graph are larger graphs obtained from a graph by a construction. In this article, χi(G) of splitting graph and shadow graph of certain classes of graphs are obtained in terms of number of vertices. Also obtained a lower and upper bound for the injective chromatic number of splitting graph and shadow graph of any graph.
Cilt
15Sayı
1Bağlantı
https://jaem.isikun.edu.tr/web/index.php/archive/127-vol15no1/1304http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6180
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 ... -
Morphisms on middle graph of semiring valued graphs
Tamilselvi, Annamalai (Işık University Press, 2024-10)The middle graph M(G) of a graph G is an intersection graph on the vertex set V (G) of any graph G. Let E(G) be an edge set of G and F = V’ (G) ∪ E(G), where V’ (G) indicates the family of all one vertex subsets of the set ... -
Reflexive edge strength of nonagon chain graph and triangle ribbon ladder graph
Hasanah, A. Iswatun; Indriati, B. Diari (Işık University Press, 2025-02-01)Let G be an undirected, simple and connected graph with vertex set V (G) and egde set E(G). An edge irregular reflexive k-labeling f is labeling such that edges labeled with integers number 1, 2, ..., ke and vertices labeled ...