scientific article; zbMATH DE number 1926055

MaRDI QIDQ4707565zbMATH OpenFDO

Authors Xiebin Chen

Publication date 10 February 2004

zbMATH Keywords

Chebyshev polynomialsLaplacian spectrumlinear recurrence relation

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• The number of spanning trees of the Cartesian product of regular graphs
• scientific article; zbMATH DE number 5584928
• The number of spanning trees in a new lexicographic product of graphs
• Number of spanning trees of different products of complete and complete bipartite graphs
• The number of spanning trees in some classes of graphs
• The number of spanning trees in circulant graphs
• The number of spanning trees of a graph
• The number of spanning trees of a graph
• scientific article; zbMATH DE number 5497806
• Sharp upper and lower bounds on the number of spanning trees in Cartesian product of graphs

Cited in

(19)

• The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)
• Counting stable sets on Cartesian products of graphs
• The number of spanning trees of the Cartesian product of regular graphs
• Number of spanning trees of different products of complete and complete bipartite graphs
• On the number of spanning trees in alternating polycyclic chains
• The number of spanning trees of the Bruhat graph
• SPC product codes, graphs with cycles and Kostka numbers
• On the brush number of the Cartesian product of tree with path or cycle
• On the number of specific spanning subgraphs of the graphs G P_n
• Tree-coritivity of Cartesian products graphs of path and path, and path and cycle
• scientific article; zbMATH DE number 3941580 (Why is no real title available?)
• scientific article; zbMATH DE number 1161299 (Why is no real title available?)
• scientific article; zbMATH DE number 1943088 (Why is no real title available?)
• A short note on the number of spanning trees in lexicographics product of graphs
• The number of spanning trees in a prism
• Cartesian products of trees and paths
• Sharp upper and lower bounds on the number of spanning trees in Cartesian product of graphs
• Convex subgraphs and spanning trees of the square cycles
• The number of spanning trees in some classes of graphs

This page was built for publication:

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