Convex subgraphs and spanning trees of the square cycles

MaRDI QIDQ6200550FDO

Authors Akihiro Munemasa, Yuuho Tanaka

Publication date 22 March 2024

Full work available at URL https://arxiv.org/abs/2302.09283

zbMATH Keywords

connected spanning convex subgraphs

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 3941580
• Cycles and spanning trees
• scientific article; zbMATH DE number 1926055
• scientific article; zbMATH DE number 5584928
• Spanning trees in subcubic graphs.

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3941580 (Why is no real title available?)
• Counting Trees in a Certain Class of Graphs
• Homotopy in \(Q\)-polynomial distance-regular graphs
• On Rationality of Generating Function for the Number of Spanning Trees in Circulant Graphs
• Rose window graphs
• The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
• The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)

This page was built for publication: Convex subgraphs and spanning trees of the square cycles

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