Wiener and Harary indices of Mycielskian graphs
Künye
Goyal, S. & T. (2025). Wiener and Harary indices of Mycielskian graphs. TWMS Journal of Applied and Engineering Mathematics, 15(11), 2687-2697.Özet
Let G = (V(G), E(G)) be a graph, where V = {v1, v2, . . . vn}. Let V′ = {v′1, v′2, . . . , v′n} be the twin of the vertex set V(G). The Mycielskian graph M(G) of G is defined as the graph whose vertex set is V(G) ∪ V′(G) ∪ {w} and the edge set is E(G) ∪ {viv′j : vivj ∈ E(G)} ∪ {v′iw ∈ V′(G)}. The vertex v′i is the twin of the vertex vi (or vi is twin of the vertex v′i) and the vertex w is the root of M(G). The closed Mycielskian graph M[G] of G is defined as the graph whose vertex set is V(G) ∪ V′(G) ∪ {w} and the edge set is E(G)∪ {viv′j : vivj ∈ E(G)} ∪ {viv′i : i = 1, 2, . . . , n}∪ {v′iw ∈ V′(G)}. The vertex v′i is the twin of the vertex vi (or vi is twin of the vertex v′i) and the vertex w is the root of M[G]. In this paper, we study the Wiener and Harary indices of the Mycielskian and closed Mycielskian graphs.
Cilt
15Sayı
11Bağlantı
https://jaem.isikun.edu.tr/web/index.php/current/137-vol15no11/1522https://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/7085
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.
-
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 ... -
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 ... -
PMC-labeling of prism allied graph, pendulum graph and cog wheel graph
Ponraj, R.; Prabhu, S. (Işık University Press, 2025-11-01)In this paper, we investigate the PMC-labeling behavior of some graphs like pendulum graph, hexagonal circular ladder, cog wheel graph, triangular wheel graph, double crown-wheel graph, crown-triangular wheel graph, Hn,n, ...




