Spanning trees of descendants of a complete graph

DOI10.2140/INVOLVE.2022.15.475MaRDI QIDQ2109090zbMATH OpenOpenAlexFDO

Authors Derya Asaner, Sayonita Ghosh Hajra, Maryam Siddique

Publication date 20 December 2022

Published in Involve (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/involve.2022.15.475

zbMATH Keywords

complete graphspanning treesWeinberg formula

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Recommendations

• scientific article; zbMATH DE number 4142059
• scientific article; zbMATH DE number 2174608
• Spanning \(k\)-trees of \(n\)-connected graphs
• Graphs with certain families of spanning trees
• Spanning trees of finite Sierpiński graphs
• Spanning trees of extended graphs
• scientific article; zbMATH DE number 1933250
• scientific article; zbMATH DE number 3948324
• Enumeration of spanning trees of certain graphs
• Spanning trees and recurrent configurations of a graph

Cites work

• A certain polynomial of a graph and graphs with an extremal number of trees
• scientific article; zbMATH DE number 3339178 (Why is no real title available?)
• scientific article; zbMATH DE number 3340110 (Why is no real title available?)
• scientific article; zbMATH DE number 3194323 (Why is no real title available?)
• Linear algebraic techniques for spanning tree enumeration
• Matrix Analysis
• On the number of Eulerian orientations of a graph
• Spanning tree formulas and Chebyshev polynomials
• Spanning tree results for graphs and multigraphs. A matrix-theoretic approach

Cited in

(3)

• Graphs with only caterpillars as spanning trees
• A definition of descendants at one point in graph calculus
• scientific article; zbMATH DE number 866664 (Why is no real title available?)

This page was built for publication: Spanning trees of descendants of a complete graph

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