Generating and counting unlabeledk-path graphs

Autor:	Lilian Markenzon, Paulo Renato da Costa Pereira, Alex Garcia
Rok vydání:	2014
Předmět:	Discrete mathematics Clique-sum Applied Mathematics Trapezoid graph Longest path problem Metric dimension Combinatorics Indifference graph Pathwidth Chordal graph Discrete Mathematics and Combinatorics Maximal independent set MathematicsofComputing_DISCRETEMATHEMATICS Mathematics
Zdroj:	Discrete Applied Mathematics. 164:297-303
ISSN:	0166-218X
Popis:	A subfamily of k-trees, the k-path graphs generalize path graphs in the same way k-trees generalize trees. This paper presents a code for unlabeled k-path graphs. The effect of structural properties of the family on the code is investigated, leading to the solution of two problems: determining the exact number of unlabeled k-path graphs with n vertices and generating all elements of the family.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::156a357152ab1bca7fc7a9a854572153 https://doi.org/10.1016/j.dam.2011.11.015 Zobrazit plný text záznamu Full Text from ScienceDirect