{"id":"https://openalex.org/W4400129980","doi":"https://doi.org/10.1142/s0129054124500126","title":"Paired Domination Integrity of Graphs","display_name":"Paired Domination Integrity of Graphs","publication_year":2024,"publication_date":"2024-06-27","ids":{"openalex":"https://openalex.org/W4400129980","doi":"https://doi.org/10.1142/s0129054124500126"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054124500126","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054124500126","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5099640839","display_name":"Annie Clare Antony","orcid":"https://orcid.org/0000-0002-4057-9710"},"institutions":[{"id":"https://openalex.org/I48018076","display_name":"Christ University","ror":"https://ror.org/022tv9y30","country_code":"IN","type":"education","lineage":["https://openalex.org/I48018076"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Annie Clare Antony","raw_affiliation_strings":["Department of Mathematics, CHRIST (Deemed to be University), Bangalore-560029, Karnataka, India"],"raw_orcid":"https://orcid.org/0000-0002-4057-9710","affiliations":[{"raw_affiliation_string":"Department of Mathematics, CHRIST (Deemed to be University), Bangalore-560029, Karnataka, India","institution_ids":["https://openalex.org/I48018076"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006103120","display_name":"V. Sangeetha","orcid":"https://orcid.org/0000-0001-9599-7197"},"institutions":[{"id":"https://openalex.org/I48018076","display_name":"Christ University","ror":"https://ror.org/022tv9y30","country_code":"IN","type":"education","lineage":["https://openalex.org/I48018076"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"V. Sangeetha","raw_affiliation_strings":["Department of Mathematics, CHRIST (Deemed to be University), Bangalore-560029, Karnataka, India"],"raw_orcid":"https://orcid.org/0000-0001-9599-7197","affiliations":[{"raw_affiliation_string":"Department of Mathematics, CHRIST (Deemed to be University), Bangalore-560029, Karnataka, India","institution_ids":["https://openalex.org/I48018076"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5099640839"],"corresponding_institution_ids":["https://openalex.org/I48018076"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11555072,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"36","issue":"02","first_page":"161","last_page":"181"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9595999717712402,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6221038103103638},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5619828104972839},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.5504962205886841},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5402526259422302},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.4884430468082428},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46980199217796326},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.44896531105041504},{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.446699321269989},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43849027156829834},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.42932283878326416},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.42829060554504395},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.416852742433548},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.12990662455558777}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6221038103103638},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5619828104972839},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.5504962205886841},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5402526259422302},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.4884430468082428},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46980199217796326},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.44896531105041504},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.446699321269989},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43849027156829834},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.42932283878326416},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.42829060554504395},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.416852742433548},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.12990662455558777},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054124500126","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054124500126","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.6299999952316284}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1493071618","https://openalex.org/W2002597062","https://openalex.org/W2003370404","https://openalex.org/W2759540335","https://openalex.org/W2955775561","https://openalex.org/W4220901992","https://openalex.org/W4288826047"],"related_works":["https://openalex.org/W2114815253","https://openalex.org/W2031691607","https://openalex.org/W2396958062","https://openalex.org/W3004945501","https://openalex.org/W1983409872","https://openalex.org/W1985573889","https://openalex.org/W2969416489","https://openalex.org/W2016451461","https://openalex.org/W382238848","https://openalex.org/W938667614"],"abstract_inverted_index":{"The":[0,132],"concept":[1,55],"of":[2,29,37,45,56,60,67,81,108,136,158,166,190,193],"vulnerability":[3,28,39],"in":[4,17,83,115,162],"a":[5,15,30,46,61,64,75,84,94,113,129],"communication":[6,31,47],"network":[7],"plays":[8],"an":[9],"important":[10],"role":[11],"when":[12],"there":[13],"is":[14,35,93,145,155],"disruption":[16],"the":[18,27,38,43,54,99,121,156,159,163,186],"network.":[19,32,48],"There":[20],"exist":[21],"several":[22],"graph":[23,62,68,85,183],"parameters":[24,40,184],"that":[25,41],"measure":[26,42,66],"Domination":[33],"integrity":[34,59,135,180,189],"one":[36],"performance":[44],"In":[49,170],"this":[50,171],"paper,":[51,172],"we":[52,173],"introduce":[53],"paired":[57,95,133,178,187],"domination":[58,134,179,188],"as":[63,147],"new":[65],"vulnerability.":[69],"Let":[70],"[Formula:":[71,86,90,109,116,125,137,142,148,152,167],"see":[72,87,91,110,117,126,138,143,149,153,168],"text]":[73,111,118,127,154],"be":[74],"simple,":[76],"connected":[77],"graph.":[78],"A":[79],"set":[80,97],"vertices":[82],"text],":[88,92,139,144,150],"say":[89],"dominating":[96],"if":[98],"following":[100],"two":[101],"conditions":[102],"are":[103],"satisfied:":[104],"(i)":[105],"every":[106],"vertex":[107],"has":[112],"neighbor":[114],"and":[119,185],"(ii)":[120],"subgraph":[122,165],"induced":[123,164],"by":[124,141],"contains":[128],"perfect":[130],"matching.":[131],"denoted":[140],"defined":[146],"where":[151],"order":[157],"largest":[160],"component":[161],"text].":[169],"determine":[174],"few":[175],"bounds":[176],"relating":[177],"with":[181],"other":[182],"some":[191],"classes":[192],"graphs.":[194]},"counts_by_year":[],"updated_date":"2025-12-26T23:08:49.675405","created_date":"2025-10-10T00:00:00"}