|
Diskretnyi Analiz i Issledovanie Operatsii, 2014, Volume 21, Issue 5, Pages 17–22
(Mi da790)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Enumeration of labeled Eulerian tetracyclic graphs
V. A. Voblyi, A. K. Meleshko Bauman Moscow State Technical University, 5 2nd Bauman St., 119333 Moscow, Russia
Abstract:
We deduce the exact and asymptotical formulas for the number of labeled Eulerian tetracyclic graphs. Ill. 1, tab. 1, bibliogr. 11.
Keywords:
enumeration, labeled graph, Eulerian graph, tetracyclic graph, asymptotics.
Received: 29.04.2014 Revised: 24.06.2014
Citation:
V. A. Voblyi, A. K. Meleshko, “Enumeration of labeled Eulerian tetracyclic graphs”, Diskretn. Anal. Issled. Oper., 21:5 (2014), 17–22
Linking options:
https://www.mathnet.ru/eng/da790 https://www.mathnet.ru/eng/da/v21/i5/p17
|
|