{"id":"https://openalex.org/W3186129569","doi":"https://doi.org/10.1080/09728600.2021.1953946","title":"Graphoidally independent infinite graphs","display_name":"Graphoidally independent infinite graphs","publication_year":2021,"publication_date":"2021-05-04","ids":{"openalex":"https://openalex.org/W3186129569","doi":"https://doi.org/10.1080/09728600.2021.1953946","mag":"3186129569"},"language":"en","primary_location":{"id":"doi:10.1080/09728600.2021.1953946","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09728600.2021.1953946","pdf_url":null,"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://doi.org/10.1080/09728600.2021.1953946","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","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, Dhaula Kuan, Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Sri Venkateswara College, University of Delhi, Dhaula Kuan, Delhi, India","institution_ids":["https://openalex.org/I110166357"]}]},{"author_position":"last","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, Dhaula Kuan, Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Sri Venkateswara College, University of Delhi, Dhaula Kuan, 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.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13838458,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"2","first_page":"95","last_page":"100"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9994999766349792,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8619065284729004},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7841383218765259},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5170831680297852},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.46588367223739624},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4528159201145172},{"id":"https://openalex.org/keywords/symmetric-graph","display_name":"Symmetric graph","score":0.4261655807495117},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4169881343841553},{"id":"https://openalex.org/keywords/vertex-transitive-graph","display_name":"Vertex-transitive graph","score":0.4123767018318176},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3698083758354187},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.27738431096076965},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.21708503365516663}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8619065284729004},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7841383218765259},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5170831680297852},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.46588367223739624},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4528159201145172},{"id":"https://openalex.org/C14201764","wikidata":"https://www.wikidata.org/wiki/Q1205074","display_name":"Symmetric graph","level":5,"score":0.4261655807495117},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4169881343841553},{"id":"https://openalex.org/C113203676","wikidata":"https://www.wikidata.org/wiki/Q220997","display_name":"Vertex-transitive graph","level":5,"score":0.4123767018318176},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3698083758354187},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.27738431096076965},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.21708503365516663},{"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.2021.1953946","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09728600.2021.1953946","pdf_url":null,"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:4ffeb77f8c9945ed9ecd5effd4fe18c4","is_oa":false,"landing_page_url":"https://doaj.org/article/4ffeb77f8c9945ed9ecd5effd4fe18c4","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 2, Pp 95-100 (2021)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1080/09728600.2021.1953946","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09728600.2021.1953946","pdf_url":null,"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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1479863711","https://openalex.org/W1566493102","https://openalex.org/W1616826450","https://openalex.org/W1974811277","https://openalex.org/W1993102073","https://openalex.org/W2021962931","https://openalex.org/W2028032378","https://openalex.org/W2047960318","https://openalex.org/W2181572306","https://openalex.org/W2320461682","https://openalex.org/W2515439052","https://openalex.org/W4247549312"],"related_works":["https://openalex.org/W3083951941","https://openalex.org/W2767628021","https://openalex.org/W2979160535","https://openalex.org/W4302082520","https://openalex.org/W1991203654","https://openalex.org/W3132248636","https://openalex.org/W3211177623","https://openalex.org/W4283766658","https://openalex.org/W2389138578","https://openalex.org/W4287393959"],"abstract_inverted_index":{"A":[0,94],"graphoidal":[1,117],"cover":[2,118],"of":[3,14,33,39,50,78,87,149],"a":[4,11,63,68,88,112,116,127],"graph":[5,71,97,113],"G":[6,34,51,79,114,122],"(not":[7,20],"necessarily":[8,21,24],"finite)":[9],"is":[10,35,52,61,108,123,125,133],"collection":[12],"\u03c8":[13,119],"paths":[15],"in":[16,44,53,57,92,100],"G,":[17],"called":[18,62,109,126],"\u03c8-edges,":[19],"finite,":[22],"not":[23],"open)":[25],"satisfying":[26],"the":[27,85],"following":[28],"axioms:":[29],"(GC-1)":[30],"Every":[31],"vertex":[32,38],"an":[36,134],"internal":[37],"at":[40],"most":[41],"one":[42,55],"path":[43,56,91],"\u03c8,":[45],"and":[46,76,111,157],"(GC-2)":[47],"every":[48],"edge":[49],"exactly":[54],"\u03c8.":[58,93],"The":[59],"pair":[60],"graphoidally":[64,69,95,128,138,150],"covered":[65,70,96],"graph.":[66,130],"In":[67,142],"two":[72,103],"distinct":[73,104],"vertices":[74,105],"u":[75],"v":[77],"are":[80,84,106],"\u03c8-adjacent":[81,107],"if":[82],"they":[83],"ends":[86],"finite":[89],"open":[90],"(or":[98],"G)":[99],"which":[101],"no":[102],"\u03c8-independent":[110,124],"possessing":[115],"such":[120],"that":[121],"independent":[129,139,151],"This":[131],"paper":[132,144],"attempt":[135],"to":[136],"characterize":[137],"infinite":[140,152,154,158],"graphs.":[141,161],"this":[143],"we":[145],"establish":[146],"complete":[147],"characterization":[148],"trees,":[153],"unicyclic":[155],"graphs":[156],"2-edge":[159],"connected":[160]},"counts_by_year":[],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}