{"id":"https://openalex.org/W1970554661","doi":"https://doi.org/10.1002/jgt.3190120110","title":"A lower bound on the number of spanning trees with <i>k</i> end\u2010vertices","display_name":"A lower bound on the number of spanning trees with <i>k</i> end\u2010vertices","publication_year":1988,"publication_date":"1988-03-01","ids":{"openalex":"https://openalex.org/W1970554661","doi":"https://doi.org/10.1002/jgt.3190120110","mag":"1970554661"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.3190120110","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190120110","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/A5007878890","display_name":"Katherine Heinrich","orcid":null},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Katherine Heinrich","raw_affiliation_strings":["Department of Mathematics and Statistics Simon Fraser University Burnaby, B.C. V5A 1S6, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics Simon Fraser University Burnaby, B.C. V5A 1S6, Canada","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102788354","display_name":"Guizhen Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]},{"id":"https://openalex.org/I154099455","display_name":"Shandong University","ror":"https://ror.org/0207yh398","country_code":"CN","type":"education","lineage":["https://openalex.org/I154099455"]}],"countries":["CA","CN"],"is_corresponding":false,"raw_author_name":"Guizhen Liu","raw_affiliation_strings":["Department of Mathematics and Statistics Simon Fraser University Burnaby, B.C. V5A 1S6, Canada","Department of Mathematics, Shandong University, Jinan, Shandong, People's Republic of China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics Simon Fraser University Burnaby, B.C. V5A 1S6, Canada","institution_ids":["https://openalex.org/I18014758"]},{"raw_affiliation_string":"Department of Mathematics, Shandong University, Jinan, Shandong, People's Republic of China","institution_ids":["https://openalex.org/I154099455"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007878890"],"corresponding_institution_ids":["https://openalex.org/I18014758"],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.0836458,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"12","issue":"1","first_page":"95","last_page":"100"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9991999864578247,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9972000122070312,"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.994700014591217,"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.9046708941459656},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8116662502288818},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7384420037269592},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.6614106893539429},{"id":"https://openalex.org/keywords/wheel-graph","display_name":"Wheel graph","score":0.5705923438072205},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5616036653518677},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4825589060783386},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.45127761363983154},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.4333345592021942},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3436243236064911},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.23564252257347107},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.0664404034614563},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.04679995775222778}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9046708941459656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8116662502288818},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7384420037269592},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.6614106893539429},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.5705923438072205},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5616036653518677},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4825589060783386},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.45127761363983154},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.4333345592021942},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3436243236064911},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.23564252257347107},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0664404034614563},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.04679995775222778},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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":1,"locations":[{"id":"doi:10.1002/jgt.3190120110","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190120110","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":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1987177025","https://openalex.org/W2076173604","https://openalex.org/W2331072996","https://openalex.org/W2385869603","https://openalex.org/W7024883515"],"related_works":["https://openalex.org/W1987177025","https://openalex.org/W4301179398","https://openalex.org/W4389325756","https://openalex.org/W4286893801","https://openalex.org/W2382032469","https://openalex.org/W2487945693","https://openalex.org/W2095369952","https://openalex.org/W2076173604","https://openalex.org/W3190987962","https://openalex.org/W2129087714"],"abstract_inverted_index":{"Abstract":[0],"If":[1],"a":[2],"graph":[3],"G":[4,24],"with":[5,13,16,31],"cycle":[6],"rank":[7],"\u03c1":[8,49],"contains":[9],"both":[10],"spanning":[11,29],"trees":[12,30],"m":[14,19,38],"and":[15],"n":[17,21],"end\u2010vertices,":[18],"&lt;":[20,39,41],",":[22],"then":[23],"has":[25],"at":[26],"least":[27],"2\u03c1":[28],"k":[32,40],"end\u2010vertices":[33],"for":[34],"each":[35],"integer":[36],"k,":[37],"n.":[42],"Moreover,":[43],"the":[44],"lower":[45],"bound":[46],"of":[47],"2":[48],"is":[50],"best":[51],"possible.":[52]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}