{"id":"https://openalex.org/W2084876293","doi":"https://doi.org/10.1002/jgt.3190120408","title":"A note on graphs with diameter\u2010preserving spanning trees","display_name":"A note on graphs with diameter\u2010preserving spanning trees","publication_year":1988,"publication_date":"1988-12-01","ids":{"openalex":"https://openalex.org/W2084876293","doi":"https://doi.org/10.1002/jgt.3190120408","mag":"2084876293"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.3190120408","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190120408","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","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/A5048753010","display_name":"Fred Buckley","orcid":null},"institutions":[{"id":"https://openalex.org/I141810926","display_name":"Baruch College","ror":"https://ror.org/023qavy03","country_code":"US","type":"education","lineage":["https://openalex.org/I141810926"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Fred Buckley","raw_affiliation_strings":["Mathematics Department Baruch College, Cuny New York, New York 10010"],"affiliations":[{"raw_affiliation_string":"Mathematics Department Baruch College, Cuny New York, New York 10010","institution_ids":["https://openalex.org/I141810926"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078847979","display_name":"Martin Lewinter","orcid":null},"institutions":[{"id":"https://openalex.org/I103497121","display_name":"Purchase College","ror":"https://ror.org/057trrr89","country_code":"US","type":"education","lineage":["https://openalex.org/I103497121"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin Lewinter","raw_affiliation_strings":["Department of Mathematics Suny at Purchase Purchase, New York 10577"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics Suny at Purchase Purchase, New York 10577","institution_ids":["https://openalex.org/I103497121"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048753010"],"corresponding_institution_ids":["https://openalex.org/I141810926"],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":1.0311,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.75898993,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"12","issue":"4","first_page":"525","last_page":"528"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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.9994000196456909,"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.9976000189781189,"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.887630820274353},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8396725058555603},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7829499244689941},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.7022802829742432},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5609888434410095},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.5152654647827148},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43805378675460815},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4196526110172272},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4165303111076355},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3645637035369873},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.19168663024902344},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10218879580497742},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.07428005337715149}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.887630820274353},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8396725058555603},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7829499244689941},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.7022802829742432},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5609888434410095},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.5152654647827148},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43805378675460815},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4196526110172272},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4165303111076355},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3645637035369873},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.19168663024902344},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10218879580497742},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.07428005337715149},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/jgt.3190120408","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190120408","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320309102","display_name":"City University of New York","ror":"https://ror.org/00453a208"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1574303240","https://openalex.org/W1985450690","https://openalex.org/W2586392344"],"related_works":["https://openalex.org/W2149927264","https://openalex.org/W4308416203","https://openalex.org/W2041764189","https://openalex.org/W2307044859","https://openalex.org/W4231397933","https://openalex.org/W2014991506","https://openalex.org/W2911818503","https://openalex.org/W168125756","https://openalex.org/W4224251989","https://openalex.org/W4380840098"],"abstract_inverted_index":{"Abstract":[0],"The":[1,26],"distance":[2,34],"between":[3,35],"a":[4,11,18],"pair":[5],"of":[6,17,29,38,47],"vertices":[7,39],"u,":[8],"v":[9,24],"in":[10,40],"graph":[12],"G":[13,30,41,48,58],"is":[14,31,49],"the":[15,32],"length":[16],"shortest":[19],"path":[20],"joining":[21],"u":[22],"and":[23],".":[25,42],"diameter":[27,50],"diam(G)":[28],"maximum":[33],"all":[36],"pairs":[37],"A":[43],"spanning":[44,69],"tree":[45],"T":[46,54],"preserving":[51],"if":[52],"diam(":[53,57],")":[55],"=":[56],").":[59],"In":[60],"this":[61],"note,":[62],"we":[63],"characterize":[64],"graphs":[65],"that":[66],"have":[67],"diameter\u2010preserving":[68],"trees.":[70]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}