Paired domination integrity of derived graphs of cycles
Künye
Antony, A. C. & Shathish, S. (2025). Paired domination integrity of derived graphs of cycles. TWMS Journal of Applied and Engineering Mathematics, 15(10), 2453-2464.Özet
The study of the vulnerability of real-life networks helps network designers construct networks such that their stability is maintained even under the disruption of a few nodes or links connecting the nodes. In this paper, we study the vulnerability of larger networks through a vulnerability parameter called paired domination integrity. The paired domination integrity of a graph G is defined as the minimum value of the sum of the cardinality of a paired dominating set S of G and the order of the largest component in < V (G)−S >. The minimum is taken over all possible paired dominating sets. The above-mentioned large networks are modelled by some derived graphs of Cn, such as the Middle, Total, Central, and Mycielskian graphs.
Cilt
15Sayı
10Bağlantı
https://jaem.isikun.edu.tr/web/index.php/current/136-vol15no10/1503https://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/7050
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 ... -
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 ...