Complexity of products of some complete and complete bipartite graphs
type: Item
instance of: scholarly article
title: Complexity of products of some complete and complete bipartite graphs
zbMATH Open document ID: 1397.05155
DOI: 10.1155/2013/673270
author: S. N. Daoud
published in: Journal of Applied Mathematics
publication date: 2018-10-10T00:00:00Z
review text: Summary: 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.
Mathematics Subject Classification ID: 05C76
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 6950812
Wikidata QID: Q59003673
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2013/673270
OpenAlex ID: W2035001841
DBLP publication ID: journals/jam/Daoud13
Recommended article: On a product dimension of bipartite graphs
Recommended article: On the complexity of construction of complete and complete bipartite graphs
Recommended article: Complexity of homomorphisms to direct products of graphs
Recommended article: Decomposition of product graphs into complete bipartite subgraphs
Recommended article: Partial product of graphs and Vizing's conjecture
Recommended article: Composition and product of cover-incomparability graphs
Recommended article: Graham's pebbling conjecture on product of complete bipartite graphs
Recommended article: Complete bipartite factorisations by complete bipartite graphs
Recommended article: Q4326212
Recommended article: Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
description: scientific article; zbMATH DE number 6950812