Open Access
Translator Disclaimer
2013 Complexity of Products of Some Complete and Complete Bipartite Graphs
S. N. Daoud
J. Appl. Math. 2013: 1-25 (2013). DOI: 10.1155/2013/673270

Abstract

The number of spanning trees in graphs (networks) is an important invariant; it is also an important measure of reliability of a network. In this paper, we derive simple formulas of the complexity, number of spanning trees, of products of some complete and complete bipartite graphs such as cartesian product, normal product, composition product, tensor product, and symmetric product, using linear algebra and matrix analysis techniques.

Citation

Download Citation

S. N. Daoud. "Complexity of Products of Some Complete and Complete Bipartite Graphs." J. Appl. Math. 2013 1 - 25, 2013. https://doi.org/10.1155/2013/673270

Information

Published: 2013
First available in Project Euclid: 14 March 2014

zbMATH: 06950812
MathSciNet: MR3138945
Digital Object Identifier: 10.1155/2013/673270

Rights: Copyright © 2013 Hindawi

JOURNAL ARTICLE
25 PAGES


SHARE
Vol.2013 • 2013
Back to Top