{"id":"https://openalex.org/W1715502087","doi":"https://doi.org/10.37236/170","title":"Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover","display_name":"Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover","publication_year":2009,"publication_date":"2009-07-02","ids":{"openalex":"https://openalex.org/W1715502087","doi":"https://doi.org/10.37236/170","mag":"1715502087"},"language":"en","primary_location":{"id":"doi:10.37236/170","is_oa":true,"landing_page_url":"https://doi.org/10.37236/170","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r81/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r81/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019759019","display_name":"Cheng Yeaw Ku","orcid":"https://orcid.org/0000-0002-8606-3402"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Cheng Yeaw Ku","raw_affiliation_strings":["National University of Singapore"],"affiliations":[{"raw_affiliation_string":"National University of Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069418477","display_name":"Kok Bin Wong","orcid":"https://orcid.org/0000-0001-5640-4432"},"institutions":[{"id":"https://openalex.org/I33849332","display_name":"University of Malaya","ror":"https://ror.org/00rzspn62","country_code":"MY","type":"education","lineage":["https://openalex.org/I33849332"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"K. B. Wong","raw_affiliation_strings":["Institute of Mathematical Sciences, University of Malaya, 50603 Kuala Lumpur, Malaysia","University of Malaya"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematical Sciences, University of Malaya, 50603 Kuala Lumpur, Malaysia","institution_ids":["https://openalex.org/I33849332"]},{"raw_affiliation_string":"University of Malaya","institution_ids":["https://openalex.org/I33849332"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019759019"],"corresponding_institution_ids":["https://openalex.org/I165932596"],"apc_list":null,"apc_paid":null,"fwci":2.3137,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.86256943,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"16","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9993000030517578,"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.9993000030517578,"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.9927999973297119,"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/T10849","display_name":"Finite Group Theory Research","score":0.9890999794006348,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8570584058761597},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7624021172523499},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6581684350967407},{"id":"https://openalex.org/keywords/multiplicity","display_name":"Multiplicity (mathematics)","score":0.6502386927604675},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5721943378448486},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5552477836608887},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.46861204504966736},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4519009292125702},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43162184953689575},{"id":"https://openalex.org/keywords/root","display_name":"Root (linguistics)","score":0.42833849787712097},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.42611798644065857},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4069811999797821},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38921231031417847},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12836650013923645},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09007975459098816},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.07457497715950012},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06656715273857117}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8570584058761597},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7624021172523499},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6581684350967407},{"id":"https://openalex.org/C156004811","wikidata":"https://www.wikidata.org/wiki/Q2228257","display_name":"Multiplicity (mathematics)","level":2,"score":0.6502386927604675},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5721943378448486},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5552477836608887},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.46861204504966736},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4519009292125702},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43162184953689575},{"id":"https://openalex.org/C171078966","wikidata":"https://www.wikidata.org/wiki/Q111029","display_name":"Root (linguistics)","level":2,"score":0.42833849787712097},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.42611798644065857},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4069811999797821},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38921231031417847},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12836650013923645},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09007975459098816},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.07457497715950012},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06656715273857117},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.37236/170","is_oa":true,"landing_page_url":"https://doi.org/10.37236/170","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r81/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:scholarbank.nus.edu.sg:10635/103536","is_oa":false,"landing_page_url":"http://scholarbank.nus.edu.sg/handle/10635/103536","pdf_url":null,"source":{"id":"https://openalex.org/S7407052290","display_name":"National University of Singapore","issn_l":null,"issn":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scopus","raw_type":"Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.214.1881","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.214.1881","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/Volume_16/PDF/v16i1r81.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.243.7483","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.243.7483","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0810.4986v1.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/170","is_oa":true,"landing_page_url":"https://doi.org/10.37236/170","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r81/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1715502087.pdf","grobid_xml":"https://content.openalex.org/works/W1715502087.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W1483244116","https://openalex.org/W1529283357","https://openalex.org/W2025871027","https://openalex.org/W2066456540","https://openalex.org/W4300568384"],"related_works":["https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W4230581126","https://openalex.org/W1566660502","https://openalex.org/W2156896570","https://openalex.org/W4378765297","https://openalex.org/W4256429076","https://openalex.org/W2888603221","https://openalex.org/W2962800320","https://openalex.org/W2062172380"],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2,12,19],"necessary":[3],"and":[4],"sufficient":[5],"condition":[6],"for":[7],"the":[8,15,25],"maximum":[9],"multiplicity":[10],"of":[11,14,18,28],"root":[13],"matching":[16],"polynomial":[17],"tree":[20],"to":[21,24,33],"be":[22],"equal":[23],"minimum":[26],"number":[27],"vertex":[29],"disjoint":[30],"paths":[31],"needed":[32],"cover":[34],"it.":[35]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}