Abstract
The purpose of this paper is to discuss two related problems in graph theory and optimum design theory: maximizing the number of spanning trees in a graph and finding a D -optimum incomplete block design. A regular complete multipartite graph is shown to have the maximum number of spanning trees among all the simple graphs with the same numbers of vertices and edges.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
