{"id":"https://openalex.org/W2078780445","doi":"https://doi.org/10.1007/s00373-013-1314-z","title":"Closure and Spanning k-Trees","display_name":"Closure and Spanning k-Trees","publication_year":2013,"publication_date":"2013-04-18","ids":{"openalex":"https://openalex.org/W2078780445","doi":"https://doi.org/10.1007/s00373-013-1314-z","mag":"2078780445"},"language":"en","primary_location":{"id":"doi:10.1007/s00373-013-1314-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00373-013-1314-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00373-013-1314-z.pdf","source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00373-013-1314-z.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110283929","display_name":"Ryota Matsubara","orcid":null},"institutions":[{"id":"https://openalex.org/I171481255","display_name":"Shibaura Institute of Technology","ror":"https://ror.org/020wjcq07","country_code":"JP","type":"education","lineage":["https://openalex.org/I171481255"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Ryota Matsubara","raw_affiliation_strings":["College of Engineering, Shibaura Institute of Technology, Saitama-shi, Japan","College of Engineering, Shibaura Institute of Technology, Saitama-shi, Japan 337-8570#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Engineering, Shibaura Institute of Technology, Saitama-shi, Japan","institution_ids":["https://openalex.org/I171481255"]},{"raw_affiliation_string":"College of Engineering, Shibaura Institute of Technology, Saitama-shi, Japan 337-8570#TAB#","institution_ids":["https://openalex.org/I171481255"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087489328","display_name":"Masao Tsugaki","orcid":"https://orcid.org/0000-0003-4757-7141"},"institutions":[{"id":"https://openalex.org/I161296585","display_name":"Tokyo University of Science","ror":"https://ror.org/05sj3n476","country_code":"JP","type":"education","lineage":["https://openalex.org/I161296585"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Masao Tsugaki","raw_affiliation_strings":["Department of Mathematical Information Science, Tokyo University of Science, Shinjuku-ku, Tokyo, Japan","Department of Mathematical Information Science, Tokyo University of Science, Shinjuku-ku, Tokyo, Japan 162-8601#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Information Science, Tokyo University of Science, Shinjuku-ku, Tokyo, Japan","institution_ids":["https://openalex.org/I161296585"]},{"raw_affiliation_string":"Department of Mathematical Information Science, Tokyo University of Science, Shinjuku-ku, Tokyo, Japan 162-8601#TAB#","institution_ids":["https://openalex.org/I161296585"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007934756","display_name":"Tomoki Yamashita","orcid":"https://orcid.org/0000-0003-2394-324X"},"institutions":[{"id":"https://openalex.org/I916559398","display_name":"Kindai University","ror":"https://ror.org/05kt9ap64","country_code":"JP","type":"education","lineage":["https://openalex.org/I916559398"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Tomoki Yamashita","raw_affiliation_strings":["Department of Mathematics, Kinki University, Higashi-Osaka, Japan","Department of Mathematics, Kinki University, Higashi-Osaka, Japan 577-8502#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Kinki University, Higashi-Osaka, Japan","institution_ids":["https://openalex.org/I916559398"]},{"raw_affiliation_string":"Department of Mathematics, Kinki University, Higashi-Osaka, Japan 577-8502#TAB#","institution_ids":["https://openalex.org/I916559398"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5007934756","https://openalex.org/A5087489328","https://openalex.org/A5110283929"],"corresponding_institution_ids":["https://openalex.org/I161296585","https://openalex.org/I171481255","https://openalex.org/I916559398"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.11676381,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"30","issue":"4","first_page":"957","last_page":"962"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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.9997000098228455,"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"}},{"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8730151653289795},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8551535606384277},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8219670653343201},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.6730313301086426},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5249526500701904},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.5027155876159668},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.4845215678215027},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46089404821395874},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.43299058079719543},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36902129650115967}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8730151653289795},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8551535606384277},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8219670653343201},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.6730313301086426},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5249526500701904},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.5027155876159668},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.4845215678215027},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46089404821395874},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.43299058079719543},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36902129650115967},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00373-013-1314-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00373-013-1314-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00373-013-1314-z.pdf","source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00373-013-1314-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00373-013-1314-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00373-013-1314-z.pdf","source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4285005702","display_name":"A study on invariants that guarantee the existence of cycles and trees","funder_award_id":"24740074","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G7221084846","display_name":"On graph factors and spanning trees with restricted degrees","funder_award_id":"23540159","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2078780445.pdf","grobid_xml":"https://content.openalex.org/works/W2078780445.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W606453859","https://openalex.org/W1992966703","https://openalex.org/W1996124717","https://openalex.org/W2000467025","https://openalex.org/W2031299486","https://openalex.org/W2075810525","https://openalex.org/W2303154786"],"related_works":["https://openalex.org/W2149927264","https://openalex.org/W4301179398","https://openalex.org/W4308416203","https://openalex.org/W2487945693","https://openalex.org/W2095369952","https://openalex.org/W3215909732","https://openalex.org/W2075810525","https://openalex.org/W2069416867","https://openalex.org/W3149836004","https://openalex.org/W3019213358"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,15,29,68,79],"new":[6],"closure":[7],"concept":[8],"for":[9,50],"spanning":[10,69,80],"k-trees.":[11],"A":[12],"k-tree":[13,70],"is":[14],"tree":[16],"with":[17,60],"maximum":[18],"degree":[19],"at":[20],"most":[21],"k.":[22],"We":[23],"prove":[24],"that:":[25],"Let":[26],"G":[27,56,66,75],"be":[28,37],"connected":[30],"graph":[31],"and":[32,35,72,94,96],"let":[33],"u":[34],"v":[36],"nonadjacent":[38],"vertices":[39],"of":[40,57],"G.":[41],"Suppose":[42],"that":[43],"$${\\sum_{w":[44],"\\in":[45,62],"S}d_G(w)":[46],"\\geq":[47],"|V(G)|":[48],"-1}$$":[49],"every":[51],"independent":[52],"set":[53],"S":[54],"in":[55],"order":[58],"k":[59],"$${u,v":[61],"S}$$":[63],".":[64],"Then":[65],"has":[67,78],"if":[71,74],"only":[73],"+":[76],"uv":[77],"k-tree.":[81],"This":[82],"result":[83,86,98],"implies":[84],"Win\u2019s":[85],"(Abh":[87],"Math":[88],"Sem":[89],"Univ":[90],"Hamburg,":[91],"43:263\u2013267,":[92],"1975)":[93],"Kano":[95],"Kishimoto\u2019s":[97],"(Graph":[99],"Comb,":[100],"2013)":[101],"as":[102],"corollaries.":[103]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}