Number of Spanning Trees of Different Products of Complete and Complete Bipartite Graphs | Zendy

S. N. Daoud | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Number of Spanning Trees of Different Products of Complete and Complete Bipartite Graphs

Author(s) -

S. N. Daoud

Publication year - 2014

Publication title -

mathematical problems in engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.262

H-Index - 62

eISSN - 1026-7077

pISSN - 1024-123X

DOI - 10.1155/2014/965105

Subject(s) - bipartite graph , spanning tree , cartesian product , mathematics , combinatorics , product (mathematics) , tensor product , complete bipartite graph , matrix (chemical analysis) , discrete mathematics , pure mathematics , graph , geometry , materials science , composite material

Spanning trees have been found to be structures of paramount importance in both theoretical and practical problems. In this paper we derive new formulas for the complexity, number of spanning trees, of some products of complete and complete bipartite graphs such as Cartesian product, normal product, composition product, tensor product, symmetric product, and strong sum, using linear algebra and matrix theory techniques.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research