Nullity and energy of the cubic power graph
Künye
Ejima, O., Tamizh Chelvam, T. & Aremu, K. O. (2024). Nullity and energy of the cubic power graph. TWMS Journal Of Applied And Engineering Mathematics, 14(2), 571-578.Özet
Let G be a finite abelian group with identity 0, G1 = {3t | t ? G} ? G and G2 = G \ G1. The cubic power graph ?cpg of G is an undirected simple graph with vertex set G, such that two distinct vertices x and y are adjacent in ?cpg if and only if x + y ? G1 \ {0}. In this paper, we first prove certain properties of the cubic power graph ?cpg of finite abelian groups. Finally, we observe some properties on the nullity of the cubic power graph ?cpg and also show that the energy of the cubic power graph of a finite abelian group of order n is bounded below by ?(n ? 3)(n ? 1)/3 if n is divisible by 3 and n ? 1 if n otherwise.
Cilt
14Sayı
2Bağlantı
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/5951https://jaem.isikun.edu.tr/web/index.php/current/124-vol14no2/1197
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 ...