{"id":"https://openalex.org/W4283825883","doi":"https://doi.org/10.1080/09728600.2022.2094734","title":"Independent 2-point set domination in graphs - II","display_name":"Independent 2-point set domination in graphs - II","publication_year":2022,"publication_date":"2022-07-06","ids":{"openalex":"https://openalex.org/W4283825883","doi":"https://doi.org/10.1080/09728600.2022.2094734"},"language":"en","primary_location":{"id":"doi:10.1080/09728600.2022.2094734","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09728600.2022.2094734","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/09728600.2022.2094734?needAccess=true","source":{"id":"https://openalex.org/S2764899362","display_name":"AKCE International Journal of Graphs and Combinatorics","issn_l":"0972-8600","issn":["0972-8600","2543-3474"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"AKCE International Journal of Graphs and Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.tandfonline.com/doi/pdf/10.1080/09728600.2022.2094734?needAccess=true","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061795542","display_name":"Deepti Jain","orcid":"https://orcid.org/0000-0002-6682-7452"},"institutions":[{"id":"https://openalex.org/I110166357","display_name":"University of Delhi","ror":"https://ror.org/04gzb2213","country_code":"IN","type":"education","lineage":["https://openalex.org/I110166357"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Deepti Jain","raw_affiliation_strings":["Department of Mathematics, Sri Venkateswara College, University of Delhi, Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Sri Venkateswara College, University of Delhi, Delhi, India","institution_ids":["https://openalex.org/I110166357"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008708299","display_name":"Purnima Gupta","orcid":"https://orcid.org/0000-0003-4389-3024"},"institutions":[{"id":"https://openalex.org/I110166357","display_name":"University of Delhi","ror":"https://ror.org/04gzb2213","country_code":"IN","type":"education","lineage":["https://openalex.org/I110166357"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Purnima Gupta","raw_affiliation_strings":["Department of Mathematics, Sri Venkateswara College, University of Delhi, Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Sri Venkateswara College, University of Delhi, Delhi, India","institution_ids":["https://openalex.org/I110166357"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061795542"],"corresponding_institution_ids":["https://openalex.org/I110166357"],"apc_list":{"value":1000,"currency":"GBP","value_usd":1226},"apc_paid":{"value":1000,"currency":"GBP","value_usd":1226},"fwci":0.1522,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.48917528,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"19","issue":"3","first_page":"201","last_page":"205"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9815999865531921,"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.9815999865531921,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8840168714523315},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8164578676223755},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7522387504577637},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.6135531663894653},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5885240435600281},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5083867907524109},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.49773767590522766},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4924350678920746},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46372362971305847},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.4513040781021118},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.4261585772037506},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42186883091926575},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.41823646426200867},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.29459869861602783},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.22752279043197632},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.15350490808486938},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08363553881645203}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8840168714523315},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8164578676223755},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7522387504577637},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.6135531663894653},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5885240435600281},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5083867907524109},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.49773767590522766},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4924350678920746},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46372362971305847},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.4513040781021118},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.4261585772037506},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42186883091926575},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.41823646426200867},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.29459869861602783},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.22752279043197632},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.15350490808486938},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08363553881645203},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/09728600.2022.2094734","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09728600.2022.2094734","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/09728600.2022.2094734?needAccess=true","source":{"id":"https://openalex.org/S2764899362","display_name":"AKCE International Journal of Graphs and Combinatorics","issn_l":"0972-8600","issn":["0972-8600","2543-3474"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"AKCE International Journal of Graphs and Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:d72536e52fde4e0c979bdaea9e43bab6","is_oa":true,"landing_page_url":"https://doaj.org/article/d72536e52fde4e0c979bdaea9e43bab6","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"AKCE International Journal of Graphs and Combinatorics, Vol 19, Iss 3, Pp 201-205 (2022)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1080/09728600.2022.2094734","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09728600.2022.2094734","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/09728600.2022.2094734?needAccess=true","source":{"id":"https://openalex.org/S2764899362","display_name":"AKCE International Journal of Graphs and Combinatorics","issn_l":"0972-8600","issn":["0972-8600","2543-3474"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"AKCE International Journal of Graphs and Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1581552469","https://openalex.org/W1974811277","https://openalex.org/W2019262465","https://openalex.org/W2781149038"],"related_works":["https://openalex.org/W2041022284","https://openalex.org/W3008087224","https://openalex.org/W1996812986","https://openalex.org/W63807318","https://openalex.org/W2898526288","https://openalex.org/W2955903066","https://openalex.org/W2607123191","https://openalex.org/W3004945501","https://openalex.org/W1968027460","https://openalex.org/W2521882261"],"abstract_inverted_index":{"AbstractA":[0],"set":[1,17,19,32],"D":[2,28],"of":[3,25,92,115],"vertices":[4,53],"in":[5,21,98],"a":[6,43,66,113],"connected":[7],"graph":[8,67,72],"G":[9,26],"is":[10,29,62],"said":[11],"to":[12,68,101],"be":[13,69],"an":[14,30,70,76],"independent":[15,31],"2-point":[16],"dominating":[18],"(or":[20],"short":[22],"i-2psd":[23,71,77,84,94,103,109,117],"set)":[24],"if":[27,73],"and":[33,96,111],"for":[34],"every":[35],"non-empty":[36,44],"subset":[37,45],"[Formula:":[38,46,59],"see":[39,47,60],"text]":[40,48,61],"there":[41],"exists":[42],"having":[49],"at":[50],"most":[51],"2":[52],"such":[54],"that":[55],"the":[56],"induced":[57],"subgraph":[58],"connected.":[63],"We":[64,86],"call":[65],"it":[74],"possesses":[75],"set.":[78],"In":[79],"this":[80],"article,":[81],"we":[82,105],"explore":[83],"graphs.":[85],"first":[87],"provide":[88],"complete":[89],"structural":[90],"characterization":[91],"separable":[93],"graphs":[95],"thereafter,":[97],"our":[99],"quest":[100],"characterize":[102,106],"blocks,":[104],"hexagon-free":[107],"bipartite":[108],"blocks":[110],"exhibit":[112],"family":[114],"non-bipartite":[116],"blocks.":[118]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-05-19T21:40:30.786675","created_date":"2025-10-10T00:00:00"}