Enumeration of labelled flower wheel graphs | Applied Discrete Mathematics. Supplement. 2016. № 9.

Enumeration of labelled flower wheel graphs

The exact formula is obtained for the number of labelled flower wheel graphs with the given numbers of vertices and petals.

Download file

Counter downloads: 185

Keywords

корневой граф, граф колесо, цветочно-колёсный граф, rooted graph, wheel graph, flower wheel graph

Authors

Name	Organization	E-mail
Voblyi V.A.	MSTU	vitvobl@yandex.ru
Meleshko A. K.	MSTU	akmeleshko@gmail.com

Всего: 2

References

Харари Ф, Палмер Э. Перечисление графов. М.: Мир, 1977.

Bhatti A A., Nisar A., and Kanwal M. Radio number of wheel like graphs // Int. J. Graph Theory in Wireless ad hoc Networks and Sensor Networks. 2011. No. 4. P. 39-57.

Brankovic L., Lopez N., Miller M., and Sebe F. Triangle randomization for social network data anonymization // Ars Math. Contemporanea. 2014. V. 7. No. 2. P. 461-477.

Jin Y.-L. Enumeration of labelled connected graphs and Euler graphs with only one cut vertex // Yokohama Math. J. 1977. No. 45. P. 125-134.

Selkow SM. The enumeration of labeled graphs by number of cutpoints // Discr. Math. 1998. No. 185. P. 183-191.