Maximizing spanning trees in almost complete graphs

DOI<97::AID-NET4>3.0.CO;2-F 10.1002/(SICI)1097-0037(199709)30:2<97::AID-NET4>3.0.CO;2-FzbMath0885.90109OpenAlexW4241140876MaRDI QIDQ4361180

Bryan Gilbert, Wendy J. Myrvold

Publication date: 26 October 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199709)30:2<97::aid-net4>3.0.co;2-f

zbMATH Keywords

number of spanning trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Dr. Charles L. Suffel: Scholar, teacher, mentor, friend ⋮ Uniformly optimally reliable graphs: A survey ⋮ The number of spanning trees in the composition graphs ⋮ Network reliability in Hamiltonian graphs ⋮ An efficient approach for counting the number of spanning trees in circulant and related graphs ⋮ Chebyshev polynomials and spanning tree formulas for circulant and related graphs