On connected subcubic graphs with n vertices and n+3 edges having maximum number of matchings

Autor:	Nikita Alexandrovich Kuzmin, Dmitry Sergeevich Malyshev
Rok vydání:	2022
Zdroj:	Proceedings of Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications".
DOI:	10.20948/dms-2022-58
Popis:	The paper completely describes connected (n,n+3)-graphs of maximal degree 3, which have the largest number of matchings.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::30c85a556042195164c7272441e53742 https://doi.org/10.20948/dms-2022-58 Zobrazit plný text záznamu