Complexity of products of some complete and complete bipartite graphs

DOI10.1155/2013/673270MaRDI QIDQ1790058zbMATH OpenOpenAlexDBLPWikidataFDO

Authors S. N. Daoud

Publication date 10 October 2018

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

Copyright license Creative Commons Attribution 4.0 International

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)

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.

Recommendations

• On a product dimension of bipartite graphs
• On the complexity of construction of complete and complete bipartite graphs
• Complexity of homomorphisms to direct products of graphs
• Decomposition of product graphs into complete bipartite subgraphs
• Partial product of graphs and Vizing's conjecture
• Composition and product of cover-incomparability graphs
• Graham's pebbling conjecture on product of complete bipartite graphs
• Complete bipartite factorisations by complete bipartite graphs
• scientific article; zbMATH DE number 734481
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices

Cited in

(11)

• The number of spanning trees in a new lexicographic product of graphs
• The number of spanning trees in the composition graphs
• The number of spanning trees of the Cartesian product of regular graphs
• The complexity of some classes of pyramid graphs created from a gear graph
• Complexity of trapezoidal graphs with different triangulations
• On the complexity of construction of complete and complete bipartite graphs
• scientific article; zbMATH DE number 55681 (Why is no real title available?)
• Number of spanning trees in different products of complete and complete tripartite graphs.
• Enumeration of spanning trees in prisms of some graphs
• A novel of adjacency and incidence measures in compound graphics
• Weighted complexities of graph products and bundles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1790058)