On the Minimum Number of Spanning Trees in Cubic Multigraphs

Let G2n, H2n be two non-isomorphic connected cubic multigraphs of order 2n with parallel edges permitted but without loops. Let t(G2n), t (H2n) denote the number of spanning trees in G2n, H2n, respectively. We prove that for n ≥ 3 there is the unique G2n such that t(G2n) < t(H2n) for any H2n. Fur...

Full description

Bibliographic Details

Published in:	Discussiones Mathematicae Graph Theory
Main Author:	Bogdanowicz Zbigniew R.
Format:	Article
Language:	English
Published:	University of Zielona Góra 2020-02-01
Subjects:	cubic multigraph spanning tree regular graph enumeration 05c05 05c38
Online Access:	https://doi.org/10.7151/dmgt.2123