Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource Faculty Publications Article Faculty Publications -Articles Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Creator An entity primarily responsible for making the resource Antony, Annie Clare; Sangeetha, V. Title A name given to the resource Paired Domination Integrity of Graphs Date A point or period of time associated with an event in the lifecycle of the resource 01-01-2025 Source A related resource from which the described resource is derived International Journal of Foundations of Computer Science;Volume;36;Issue;2;pp.161-181 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1142/S0129054124500126" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S0129054124500126</a> <br /><br /><a href="https://www.scopus.com/pages/publications/85197660125?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/85197660125?origin=resultslist</a> Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Antony A.C., Department of Mathematics CHRIST, Deemed to be University), Karnataka, Bangalore, 560029, India; Sangeetha V., Department of Mathematics CHRIST, Deemed to be University), Karnataka, Bangalore, 560029, India Description An account of the resource The concept of vulnerability in a communication network plays an important role when there is a disruption in the network. There exist several graph parameters that measure the vulnerability of a communication network. Domination integrity is one of the vulnerability parameters that measure the performance of a communication network. In this paper, we introduce the concept of paired domination integrity of a graph as a new measure of graph vulnerability. Let G = (V, E) be a simple, connected graph. A set of vertices in a graph G, say S, is a paired dominating set if the following two conditions are satisfied: (i) every vertex of G has a neighbor in S and (ii) the subgraph induced by S contains a perfect matching. The paired domination integrity of G, denoted by PDI(G), is defined as PDI(G) = min{|S|+m(G?S): S is a paired dominating set of G}, where m(G?S) is the order of the largest component in the induced subgraph of G?S. In this paper, we determine few bounds relating paired domination integrity with other graph parameters and the paired domination integrity of some classes of graphs. 2025 World Scientific Publishing Company. Subject The topic of the resource domination integrity; Integrity; paired dominating set; paired domination integrity Publisher An entity responsible for making the resource available World Scientific Relation A related resource ISSN: 1290541; Language A language of the resource English Type The nature or genre of the resource Article Rights Information about rights held in and over the resource Restricted Access; Hardcopy may be available in the library Format The file format, physical medium, or dimensions of the resource online