|
This article is cited in 3 scientific papers (total in 3 papers)
Applied Graph Theory
Maximal outerplane graphs with two simplicial vertices
Y. L. Nosov Lipetsk, Russia
Abstract:
The class of maximal outerplane graphs with two simplicial vertices is considered. The following results are obtained for graphs of this class: recursive characterization, a formula for computation of unlabeled graphs, a complete invariant that differs from the known complete invariant of arbitrary maximal outerplane graphs, and a polynomial algorithm for computation of the complete invariant.
Keywords:
maximal outerplanar graphs, $2$-path, enumeration, unlabeled graphs, complete invariant.
Citation:
Y. L. Nosov, “Maximal outerplane graphs with two simplicial vertices”, Prikl. Diskr. Mat., 2015, no. 3(29), 95–109
Linking options:
https://www.mathnet.ru/eng/pdm515 https://www.mathnet.ru/eng/pdm/y2015/i3/p95
|
Statistics & downloads: |
Abstract page: | 169 | Full-text PDF : | 82 | References: | 47 |
|