A short note on the number of spanning trees in lexicographics product of graphs

zbMATH Open1383.05164MaRDI QIDQ4604136FDOQ4604136

Authors: Yujun Yang 

Publication date: 23 February 2018

Recommendations

• The number of spanning trees in a new lexicographic product of graphs
• Note on the spanning-tree packing number of lexicographic product graphs
• Sharp upper and lower bounds on the number of spanning trees in Cartesian product of graphs
• scientific article; zbMATH DE number 1926055
• Number of spanning trees of different products of complete and complete bipartite graphs

zbMATH Keywords

Laplacian spectrumspanning treematrix-tree theoremlexicographic product

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graph operations (line graphs, products, etc.) (05C76)

Cited In (5)

• Sharp upper and lower bounds on the number of spanning trees in Cartesian product of graphs
• Note on the spanning-tree packing number of lexicographic product graphs
• 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 of the Cartesian product of regular graphs

This page was built for publication: A short note on the number of spanning trees in lexicographics product of graphs

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