Counting matchable spanning trees of join graphs

Cites work

scientific article; zbMATH DE number 1179517 (Why is no real title available?)
scientific article; zbMATH DE number 3445271 (Why is no real title available?)
scientific article; zbMATH DE number 3895093 (Why is no real title available?)
A simple formula for the number of spanning trees of line graphs
A variant of the Teufl-Wagner formula and applications
Counting spanning trees in a complete bipartite graph which contain a given spanning forest
Counting spanning trees in almost complete multipartite graphs
Counting spanning trees of \((1, N\))-periodic graphs
Counting spanning trees with a Kekulé structure in linear hexagonal chains
Determinant identities for Laplace matrices
Enumerating spanning trees of graphs with an involution
Enumeration of spanning trees containing a perfect matching in linear polygonal chains
Enumeration of spanning trees containing perfect matchings in hexagonal chains with a unique kink
Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip
Expression for the number of spanning trees of line graphs of arbitrary connected graphs
Graph theory
Graphs where each spanning tree has a perfect matching
Integral complete split graphs
On graphs with a unique perfect matching
On trees with perfect matchings
On two conjectures concerning spanning tree edge dependences of graphs
Resistance distance in complete n-partite graphs
Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
Spectral radius and edge‐disjoint spanning trees
Trees with 1-factors and oriented trees

This page was built for publication: Counting matchable spanning trees of join graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7240759)