scientific article; zbMATH DE number 2230252

MaRDI QIDQ5708545zbMATH OpenFDO

Authors Stavros D. Nikolopoulos, Charis Papadopoulos

Publication date 18 November 2005

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

Mathematics Subject Classification ID

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

Cites work

• A formula for the number of spanning trees of a multi-star related graph
• A Linear Recognition Algorithm for Cographs
• A new technique for the characterization of graphs with a maximum number of spanning trees
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 932184 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• Laplacian spectra and spanning trees of threshold graphs
• Maximizing spanning trees in almost complete graphs
• On the characterization of graphs with maximum number of spanning trees
• On the number of spanning trees of a multi-complete/star related graph
• On the number of spanning trees of multi-star related graphs
• Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes
• The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
• The number of spanning trees in circulant graphs
• The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)
• Uniformly-most reliable networks do not always exist

Cited in

(1)

• Tree enumeration polynomials on separable permutations

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 Q5708545)