Cubic Graphs with Minimum Number of Spanning Trees

Abstract

In this paper we prove that there exists one type of connected cubic graph,which minimizes the number of spanning trees over all other connected cubic graphs of the same order \(7\), \(n\geq 14\).