{"id":"https://openalex.org/W2158908115","doi":"https://doi.org/10.1080/00207169908804886","title":"On tree roots of graphs","display_name":"On tree roots of graphs","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2158908115","doi":"https://doi.org/10.1080/00207169908804886","mag":"2158908115"},"language":"en","primary_location":{"id":"doi:10.1080/00207169908804886","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169908804886","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5046358411","display_name":"Sangeeta Gupta","orcid":"https://orcid.org/0000-0002-5339-2576"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"S.K. Gupta","raw_affiliation_strings":["Department of Computer Science and Engineering , Indian Institute of Technology , New Delhi, 16,  India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering , Indian Institute of Technology , New Delhi, 16,  India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101413381","display_name":"Amrinder Singh","orcid":"https://orcid.org/0000-0002-0378-8476"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Amrinder Singh","raw_affiliation_strings":["Department of Computer Science and Engineering , Indian Institute of Technology , New Delhi, 16,  India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering , Indian Institute of Technology , New Delhi, 16,  India","institution_ids":["https://openalex.org/I68891433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046358411"],"corresponding_institution_ids":["https://openalex.org/I68891433"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.23873645,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"73","issue":"2","first_page":"157","last_page":"166"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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.9991000294685364,"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.9991000294685364,"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.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.843651294708252},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8151544332504272},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6832886338233948},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47038379311561584},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41013482213020325}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.843651294708252},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8151544332504272},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6832886338233948},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47038379311561584},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41013482213020325}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/00207169908804886","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169908804886","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.561.4902","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.561.4902","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bowiestate.edu/~aarora/papers/TreeRootsOfGraph_IJCM_1999.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W75076678","https://openalex.org/W202816115","https://openalex.org/W1519532587","https://openalex.org/W1593965134","https://openalex.org/W2057084070","https://openalex.org/W2799004609","https://openalex.org/W4213214460","https://openalex.org/W4291439952"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2042127053","https://openalex.org/W2142036596","https://openalex.org/W2072657027"],"abstract_inverted_index":{"A":[0],"graphG\u2032=(V\u2032,":[1],"E\u2032)":[2],"is":[3,73,94,116],"defined":[4],"to":[5,30,64,68],"be":[6,31],"the":[7,84,95,113],"nth":[8,33,44,57,96],"power":[9,45,75,97],"of":[10,35,76,98,104,112],"a":[11,42,50,71,77],"graph":[12,39,51,72,86],"G=(V,":[13],"E)":[14],"if":[15],"E\u2032={(x,":[16],"y)|":[17],"d(x,":[18],"y)\u2264n":[19],"in":[20,90,110],"G":[21,28,40],"and":[22,106],"V\u2032=V\u00b7G\u2032is":[23],"denoted":[24],"by":[25],"Gn":[26,36],".":[27,37],"said":[29],"an":[32,66],"root":[34],"Every":[38],"has":[41],"unique":[43],"for":[46],"all":[47,99],"n\u22651,":[48],"but":[49],"may":[52],"have":[53],"zero":[54],"or":[55],"more":[56],"roots.":[58],"In":[59],"this":[60],"paper,":[61],"we":[62,81],"endeavour":[63],"devise":[65],"algorithm":[67],"determine":[69],"whether":[70],"some":[74,111],"tree":[78],"T.":[79],"Also,":[80],"assume":[82],"that":[83,91,118],"given":[85],"G\u2247Kp":[87],",":[88],"since":[89],"case":[92],"it":[93,115],"trees":[100],"with":[101],"same":[102],"number":[103],"vertices":[105],"diameter":[107],"d\u2265n":[108],"(Hence":[109],"lemmas":[114],"assumed":[117],"d(T)>n).":[119]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}