scientific article; zbMATH DE number 2230252

zbMath1075.05546MaRDI QIDQ5708545

Charis Papadopoulos, Stavros D. Nikolopoulos

Publication date: 18 November 2005

Full work available at URL: http://www.sciencedirect.com/science/journal/15710653

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of spanning trees of multi-star related graphs
• A formula for the number of spanning trees of a multi-star related graph
• On the number of spanning trees of a multi-complete/star related graph
• The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
• A new technique for the characterization of graphs with a maximum number of spanning trees
• The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)
• On the characterization of graphs with maximum number of spanning trees
• The number of spanning trees in circulant graphs
• Laplacian spectra and spanning trees of threshold graphs
• Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes
• Uniformly-most reliable networks do not always exist
• A Linear Recognition Algorithm for Cographs
• Maximizing spanning trees in almost complete graphs

This page was built for publication: