Finding the Graph with the Maximum Number of Spanning Trees

George Moustakides; Samuel D. Bedrosian

doi:10.1016/0016-0032(80)90012-5

Finding the Graph with the Maximum Number of Spanning Trees

George Moustakides
, Samuel D. Bedrosian

Research output: Contribution to journal › Article › peer-review

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 K_N. Our solution is for D less than or equal to N

Original language	English (US)
Pages (from-to)	343-348
Number of pages	6
Journal	Journal of the Franklin Institute
Volume	310
Issue number	6
DOIs	https://doi.org/10.1016/0016-0032(80)90012-5
State	Published - 1980
Externally published	Yes

All Science Journal Classification (ASJC) codes

Control and Systems Engineering
Signal Processing
Computer Networks and Communications
Applied Mathematics

Access to Document

10.1016/0016-0032(80)90012-5

Cite this

@article{fb4ae84b224c4a26aab676c84cb0f21a,

title = "Finding the Graph with the Maximum Number of Spanning Trees",

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",

author = "George Moustakides and Bedrosian, \{Samuel D.\}",

year = "1980",

doi = "10.1016/0016-0032(80)90012-5",

language = "English (US)",

volume = "310",

pages = "343--348",

journal = "Journal of the Franklin Institute",

issn = "0016-0032",

publisher = "Elsevier Ltd",

number = "6",

}

TY - JOUR

T1 - Finding the Graph with the Maximum Number of Spanning Trees

AU - Moustakides, George

AU - Bedrosian, Samuel D.

PY - 1980

Y1 - 1980

N2 - 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

AB - 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

UR - https://www.scopus.com/pages/publications/85025715103

UR - https://www.scopus.com/pages/publications/85025715103#tab=citedBy

U2 - 10.1016/0016-0032(80)90012-5

DO - 10.1016/0016-0032(80)90012-5

M3 - Article

AN - SCOPUS:85025715103

SN - 0016-0032

VL - 310

SP - 343

EP - 348

JO - Journal of the Franklin Institute

JF - Journal of the Franklin Institute

IS - 6

ER -

Finding the Graph with the Maximum Number of Spanning Trees

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this