Finding the Graph with the Maximum Number of Spanning Trees |
| |
| Authors: | George Moustakides Samuel D Bedrosian |
| |
| Institution: | Systems Engineering Department, Moore School of Electrical Engineering, University of Pennsylvania, Philadelphia, Pennsylvania 19104, USA U.S.A. |
| |
| Abstract: | The problem is to determine the linear graph that has the maximum number of spanning trees, where only the number of nodes N and the number of branches B are prescribed. We deal with connected graphs G(N,B) obtained by deleting D branches from a complete graph KN. Our solution is for D less than or equal to N |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
