{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T05:17:45Z","timestamp":1740633465321,"version":"3.38.0"},"reference-count":14,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2025,2]]},"abstract":"<jats:p> 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 [Formula: see text] be a simple, connected graph. A set of vertices in a graph [Formula: see text], say [Formula: see text], is a paired dominating set if the following two conditions are satisfied: (i) every vertex of [Formula: see text] has a neighbor in [Formula: see text] and (ii) the subgraph induced by [Formula: see text] contains a perfect matching. The paired domination integrity of [Formula: see text], denoted by [Formula: see text], is defined as [Formula: see text], where [Formula: see text] is the order of the largest component in the induced subgraph of [Formula: see text]. 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. <\/jats:p>","DOI":"10.1142\/s0129054124500126","type":"journal-article","created":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T08:31:32Z","timestamp":1719563492000},"page":"161-181","source":"Crossref","is-referenced-by-count":0,"title":["Paired Domination Integrity of Graphs"],"prefix":"10.1142","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4057-9710","authenticated-orcid":false,"given":"Annie Clare","family":"Antony","sequence":"first","affiliation":[{"name":"Department of Mathematics, CHRIST (Deemed to be University), Bangalore-560029, Karnataka, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9599-7197","authenticated-orcid":false,"given":"V.","family":"Sangeetha","sequence":"additional","affiliation":[{"name":"Department of Mathematics, CHRIST (Deemed to be University), Bangalore-560029, Karnataka, India"}]}],"member":"219","published-online":{"date-parts":[[2024,6,27]]},"reference":[{"key":"S0129054124500126BIB001","first-page":"258","volume":"11","author":"Balaraman G.","year":"2021","journal-title":"TWMS Journal of Applied and Engineering Mathematics"},{"key":"S0129054124500126BIB002","first-page":"13","author":"Barefoot C. A.","year":"1987","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"issue":"1","key":"S0129054124500126BIB003","first-page":"11","volume":"4","author":"Besirik A.","year":"2019","journal-title":"Journal of Modern Technology and Engineering"},{"key":"S0129054124500126BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"S0129054124500126BIB005","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-213189"},{"key":"S0129054124500126BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-022-02542-7"},{"issue":"65","key":"S0129054124500126BIB007","first-page":"2021","volume":"12","author":"Harisaran G.","journal-title":"Indian Journal of Natural Sciences"},{"key":"S0129054124500126BIB008","doi-asserted-by":"publisher","DOI":"10.1201\/9781482246582"},{"key":"S0129054124500126BIB009","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F"},{"key":"S0129054124500126BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.01.019"},{"key":"S0129054124500126BIB011","doi-asserted-by":"publisher","DOI":"10.18576\/msl\/060307"},{"key":"S0129054124500126BIB012","doi-asserted-by":"publisher","DOI":"10.1063\/1.5112253"},{"key":"S0129054124500126BIB013","first-page":"88","author":"Sundareswaran R.","year":"2010","journal-title":"Algebra, Graph Theory and Their Applications"},{"key":"S0129054124500126BIB014","volume-title":"Introduction to Graph Theory","volume":"2","author":"West D. B.","year":"2001"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054124500126","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T09:13:43Z","timestamp":1740561223000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054124500126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,27]]},"references-count":14,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["10.1142\/S0129054124500126"],"URL":"https:\/\/doi.org\/10.1142\/s0129054124500126","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2024,6,27]]}}}