Complexity of products of some complete and complete bipartite graphs

DOI10.1155/2013/673270zbMath1397.05155OpenAlexW2035001841WikidataQ59003673 ScholiaQ59003673MaRDI QIDQ1790058

S. N. Daoud

Publication date: 10 October 2018

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/673270

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Enumeration of spanning trees in prisms of some graphs ⋮ The number of spanning trees of the Cartesian product of regular graphs

This page was built for publication: Complexity of products of some complete and complete bipartite graphs