{"id":"https://openalex.org/W4283749195","doi":"https://doi.org/10.1080/09728600.2022.2077674","title":"Truly non-trivial graphoidal graphs","display_name":"Truly non-trivial graphoidal graphs","publication_year":2022,"publication_date":"2022-05-04","ids":{"openalex":"https://openalex.org/W4283749195","doi":"https://doi.org/10.1080/09728600.2022.2077674"},"language":"en","primary_location":{"id":"doi:10.1080/09728600.2022.2077674","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09728600.2022.2077674","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.2022.2077674","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024994848","display_name":"Rajesh Singh","orcid":"https://orcid.org/0000-0002-2184-8655"},"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":"Rajesh Singh","raw_affiliation_strings":["Department of Mathematics, Ramanujan College, University of Delhi, Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Ramanujan College, University of Delhi, Delhi, India","institution_ids":["https://openalex.org/I110166357"]}]},{"author_position":"middle","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"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043658441","display_name":"S. Arumugam","orcid":"https://orcid.org/0000-0002-4477-9453"},"institutions":[{"id":"https://openalex.org/I98499257","display_name":"Kalasalingam Academy of Research and Education","ror":"https://ror.org/04fm2fn75","country_code":"IN","type":"education","lineage":["https://openalex.org/I98499257"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"S. Arumugam","raw_affiliation_strings":["National Centre for Advanced Research in Discrete Mathematics, Kalasalingam University, Krishnankoil, Tamil Nadu, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Centre for Advanced Research in Discrete Mathematics, Kalasalingam University, Krishnankoil, Tamil Nadu, India","institution_ids":["https://openalex.org/I98499257"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5024994848"],"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.09246918,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":"2","first_page":"112","last_page":"117"},"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/T11476","display_name":"Graph theory and applications","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9965000152587891,"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.8164639472961426},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7136890888214111},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.679764986038208},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6121269464492798},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.5470165610313416},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5321171879768372},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5193991661071777},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5064111948013306},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44467851519584656},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4361311197280884},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17168262600898743}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8164639472961426},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7136890888214111},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.679764986038208},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6121269464492798},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.5470165610313416},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5321171879768372},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5193991661071777},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5064111948013306},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44467851519584656},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4361311197280884},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17168262600898743},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/09728600.2022.2077674","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09728600.2022.2077674","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:890c96b0d4a543eab5aee59ea8c00c66","is_oa":true,"landing_page_url":"https://doaj.org/article/890c96b0d4a543eab5aee59ea8c00c66","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 2, Pp 112-117 (2022)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1080/09728600.2022.2077674","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09728600.2022.2077674","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/W1974811277","https://openalex.org/W1976489861","https://openalex.org/W1988932681","https://openalex.org/W1993102073","https://openalex.org/W1993412054","https://openalex.org/W2006621708","https://openalex.org/W2021962931","https://openalex.org/W2028032378","https://openalex.org/W2036751548","https://openalex.org/W2047960318","https://openalex.org/W2063733383","https://openalex.org/W4213214460"],"related_works":["https://openalex.org/W2949255922","https://openalex.org/W2036594069","https://openalex.org/W4244658307","https://openalex.org/W2156896570","https://openalex.org/W2038655901","https://openalex.org/W1627181101","https://openalex.org/W2043560626","https://openalex.org/W1558145674","https://openalex.org/W9203110","https://openalex.org/W2379188955"],"abstract_inverted_index":{"A":[0],"graphoidal":[1,55,66,74,77,97,134,156,165,176],"cover":[2,67,75,166],"of":[3,11,25,31,41,57,79,110,123,140],"a":[4,8,54,71,91,95,118,128,132,175],"graph":[5,58,92,129,172],"G":[6,26,42,59],"is":[7,27,43,69],"collection":[9],"\u03a8":[10,37,56,68],"non-trivial":[12,73],"paths":[13],"in":[14,36,44,48,53,107,121],"G,":[15],"which":[16],"are":[17,105],"not":[18],"necessarily":[19],"open,":[20],"such":[21,174],"that":[22,102,169],"every":[23,39,51,170],"vertex":[24,30],"an":[28,138],"internal":[29],"at":[32,62],"most":[33],"one":[34,46],"path":[35,47,52],"and":[38,125,149,167],"edge":[40],"exactly":[45],"\u03a8.":[49],"If":[50],"has":[60],"length":[61],"least":[63],"2,":[64],"then":[65],"called":[70],"truly":[72],"(TNT":[76],"cover)":[78],"G.":[80],"In":[81],"this":[82],"paper":[83],"we":[84,144,159],"obtain":[85,117],"some":[86],"structural":[87],"necessary":[88,119,142],"conditions":[89,104],"for":[90,127],"to":[93,130],"possess":[94,131],"TNT":[96,133,155,164],"cover.":[98,135,157,177],"We":[99,115],"also":[100,116],"exhibit":[101],"these":[103],"sufficient":[106],"the":[108,141],"case":[109],"trees":[111],"with":[112],"diameter":[113],"\u22645.":[114],"condition":[120],"terms":[122],"order":[124],"size":[126],"Thereafter":[136],"as":[137],"application":[139],"condition,":[143],"characterize":[145],"complete":[146,150],"graphs":[147,152,162],"Kn":[148],"bipartite":[151],"Km,n":[153],"possessing":[154,163],"Finally,":[158],"discuss":[160],"regular":[161],"prove":[168],"3-regular":[171],"possesses":[173]},"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}