Spanning tree results for graphs and multigraphs. A matrix-theoretic approach
DOI10.1142/8963zbMATH Open1321.05003OpenAlexW4255945316MaRDI QIDQ2931362FDOQ2931362
Authors: John T. Saccoman, Charles L. Suffel, Daniel J. Gross 
Publication date: 25 November 2014
Full work available at URL: https://doi.org/10.1142/8963
Recommendations
- On the characterization of graphs with maximum number of spanning trees
- scientific article; zbMATH DE number 55681
- On the number of spanning trees in graphs with multiple edges
- scientific article; zbMATH DE number 932184
- Maximizing the number of spanning trees of networks based on cycle basis representation
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Basic linear algebra (15A99) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Enumeration in graph theory (05C30) Special matrices (15B99)
Cited In (8)
- Sixty years of network reliability
- Title not available (Why is that?)
- Spanning trees of descendants of a complete graph
- Laplacian integral multigraphs
- Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
- Kirchhoff's matrix-tree theorem revisited: counting spanning trees with the quantum relative entropy
- On the number of spanning trees in graphs with multiple edges
- Estimates of general Mayer graphs. I. Construction of upper bounds for a given graph by means of sets of subgraphs. III. Upper bounds obtained by means of spanning n-trees. IV. On the computation of Gaussian integrals by star-mesh transformation
This page was built for publication: Spanning tree results for graphs and multigraphs. A matrix-theoretic approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931362)
