On star chromatic number of prism graph families
Künye
Kowsalya, V., Vivin, J. V. & Kumar, S. V. (2019). On star chromatic number of prism graph families. TWMS Journal of Applied and Engineering Mathematics, 9(3), 687-692.Özet
In this paper, we find the star chromatic number ?s for the central graph of prism graph C(Yn), line graph of prism graph L(Yn), middle graph of prism graph M(Yn) and the total graph of prism graph T(Yn) for all n ? 3.
Cilt
9Sayı
3Bağlantı
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2760http://jaem.isikun.edu.tr/web/index.php/archive/102-vol9no3/453
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 ... -
On the injective chromatic number of splitting graph and shadow graph of certain regular and biregular graphs
C. K., Bhanupriya; M. S., Sunitha (Işık University Press, 2025-01)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 ... -
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 ...