Number of spanning trees of different products of complete and complete bipartite graphs

DOI10.1155/2014/965105zbMath1407.05128OpenAlexW2067691662WikidataQ59071217 ScholiaQ59071217MaRDI QIDQ1719484

S. N. Daoud

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/965105

Mathematics Subject Classification ID

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

Related Items (2)

Enumeration of spanning trees in prisms of some graphs ⋮ The existence of spanning ended system on claw-free graphs

Uses Software

• Concorde

Cites Work

• On the complexity of a class of pyramid graphs and Chebyshev polynomials
• Further analysis of the number of spanning trees in circulant graphs
• Bijections for Cayley trees, spanning trees, and their q-analogues
• The number of spanning trees of a complete multipartite graph
• 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
• The number of spanning trees in odd valent circulant graphs
• Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes
• On the number of Eulerian orientations of a graph
• The Enumeration of Point Labelled Chromatic Graphs and Trees
• Uniformly-most reliable networks do not always exist
• The Complexity of Enumeration and Reliability Problems
• A textbook of graph theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Number of spanning trees of different products of complete and complete bipartite graphs