Non-intersection power graphs and co-prime graphs of finite groups
Künye
Swathi, V. V. & Sunitha, M. S. (2025). Non-intersection power graphs and co-prime graphs of finite groups. TWMS Journal of Applied and Engineering Mathematics, 15(2), 473-485.Özet
In this paper, we define the non-intersection power graph of a finite group G as a graph whose vertex set is G, and edge set consists of unordered pairs {u, v} of vertices such that ⟨u⟩ ∩ ⟨v⟩ = {e}. We find some structural properties, planarity and independence number of non-intersection power graphs of finite groups. We classify all groups whose non-intersection power graph and co-prime graph are identical. Also we calculate some topological indices such as Wiener index, Harary index and Zagreb index of co-prime graphs of some groups.
Cilt
15Sayı
2Bağlantı
https://jaem.isikun.edu.tr/web/index.php/archive/128-vol15no2/1339http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6268
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 ...