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

2014 ◽  
Vol 2014 ◽  
pp. 1-23 ◽  
Author(s):  
S. N. Daoud
Keyword(s):  
Tensor Product ◽  
Linear Algebra ◽  
Spanning Trees ◽  
Matrix Theory ◽  
Cartesian Product ◽  
Bipartite Graphs ◽  
Normal Product ◽  
Complete Bipartite Graphs ◽  
Composition Product ◽  
Number Of Spanning Trees

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.

scholarly journals Complexity of Products of Some Complete and Complete Bipartite Graphs

2013 ◽  
Vol 2013 ◽  
pp. 1-25 ◽  
Author(s):  
S. N. Daoud
Keyword(s):  
Tensor Product ◽  
Spanning Trees ◽  
Cartesian Product ◽  
Bipartite Graphs ◽  
Matrix Analysis ◽  
Normal Product ◽  
Analysis Techniques ◽  
Complete Bipartite Graphs ◽  
Composition Product ◽  
Number Of Spanning Trees

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.

scholarly journals The Number of Spanning Trees in the Composition Graphs

2014 ◽  
Vol 2014 ◽  
pp. 1-5
Author(s):  
Feng Li
Keyword(s):  
Linear Algebra ◽  
Spanning Trees ◽  
Matrix Theory ◽  
Structural Parameters ◽  
The Other ◽  
Arbitrary Graph ◽  
Large Graphs ◽  
Laplacian Eigenvalues ◽  
Number Of Spanning Trees

Using the composition of some existing smaller graphs to construct some large graphs, the number of spanning trees and the Laplacian eigenvalues of such large graphs are also closely related to those of the corresponding smaller ones. By using tools from linear algebra and matrix theory, we establish closed formulae for the number of spanning trees of the composition of two graphs with one of them being an arbitrary complete 3-partite graph and the other being an arbitrary graph. Our results extend some of the previous work, which depend on the structural parameters such as the number of vertices and eigenvalues of the small graphs only.

scholarly journals Complexity of Some Generalized Operations on Networks

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-29
Author(s):  
Muhammad Javaid ◽  
Hafiz Usman Afzal ◽  
Shaohui Wang
Keyword(s):  
Linear Algebra ◽  
Chebyshev Polynomials ◽  
Spanning Trees ◽  
Matrix Theory ◽  
Connected Components ◽  
Number Of Spanning Trees

The number of spanning trees in a network determines the totality of acyclic and connected components present within. This number is termed as complexity of the network. In this article, we address the closed formulae of the complexity of networks’ operations such as duplication (split, shadow, and vortex networks of S n ), sum ( S n + W 3 , S n + K 2 , and C n ∘ K 2 + K 1 ), product ( S n ⊠ K 2 and W n ∘ K 2 ), semitotal networks ( Q S n and R S n ), and edge subdivision of the wheel. All our findings in this article have been obtained by applying the methods from linear algebra, matrix theory, and Chebyshev polynomials. Our results shall also be summarized with the help of individual plots and relative comparison at the end of this article.

scholarly journals Computing the number of h-edge spanning forests in complete bipartite graphs

2014 ◽  
Vol Vol. 16 no. 1 (Analysis of Algorithms) ◽  
Author(s):  
Rebecca Stones
Keyword(s):  
Bipartite Graph ◽  
Spanning Trees ◽  
Analysis Of Algorithms ◽  
Complete Bipartite Graph ◽  
Bipartite Graphs ◽  
Spanning Forests ◽  
International Audience ◽  
Complete Bipartite Graphs ◽  
Number Of Spanning Trees

Analysis of Algorithms International audience Let fm,n,h be the number of spanning forests with h edges in the complete bipartite graph Km,n. Kirchhoff\textquoterights Matrix Tree Theorem implies fm,n,m+n-1=mn-1 nm-1 when m ≥1 and n ≥1, since fm,n,m+n-1 is the number of spanning trees in Km,n. In this paper, we give an algorithm for computing fm,n,h for general m,n,h. We implement this algorithm and use it to compute all non-zero fm,n,h when m ≤50 and n ≤50 in under 2 days.

ON MOSTAR INDEX OF GRAPHS

2021 ◽  
Vol 10 (4) ◽  
pp. 2115-2129
Author(s):  
P. Kandan ◽  
S. Subramanian
Keyword(s):  
Connected Graph ◽  
Cartesian Product ◽  
Bipartite Graphs ◽  
Topological Indices ◽  
Great Success ◽  
Complete Graphs ◽  
Molecular Graphs ◽  
Graphs And Networks ◽  
Complete Bipartite Graphs ◽  
Simple Connected Graph

On the great success of bond-additive topological indices like Szeged, Padmakar-Ivan, Zagreb, and irregularity measures, yet another index, the Mostar index, has been introduced recently as a peripherality measure in molecular graphs and networks. For a connected graph G, the Mostar index is defined as $$M_{o}(G)=\displaystyle{\sum\limits_{e=gh\epsilon E(G)}}C(gh),$$ where $C(gh) \,=\,\left|n_{g}(e)-n_{h}(e)\right|$ be the contribution of edge $uv$ and $n_{g}(e)$ denotes the number of vertices of $G$ lying closer to vertex $g$ than to vertex $h$ ($n_{h}(e)$ define similarly). In this paper, we prove a general form of the results obtained by $Do\check{s}li\acute{c}$ et al.\cite{18} for compute the Mostar index to the Cartesian product of two simple connected graph. Using this result, we have derived the Cartesian product of paths, cycles, complete bipartite graphs, complete graphs and to some molecular graphs.

scholarly journals Vertex Degrees and Isomorphic Properties in Complement of an m-Polar Fuzzy Graph

2017 ◽  
Vol 2017 ◽  
pp. 1-9
Author(s):  
Ch. Ramprasad ◽  
P. L. N. Varma ◽  
S. Satyanarayana ◽  
N. Srinivasarao
Keyword(s):  
Graph Theory ◽  
Tensor Product ◽  
Computer Science ◽  
Computational Intelligence ◽  
Cartesian Product ◽  
Combinatorial Problems ◽  
Fuzzy Graph ◽  
Normal Product ◽  
Product Graphs ◽  
Vertex Degrees

Computational intelligence and computer science rely on graph theory to solve combinatorial problems. Normal product and tensor product of an m-polar fuzzy graph have been introduced in this article. Degrees of vertices in various product graphs, like Cartesian product, composition, tensor product, and normal product, have been computed. Complement and μ-complement of an m-polar fuzzy graph are defined and some properties are studied. An application of an m-polar fuzzy graph is also presented in this article.

scholarly journals On Cartesian Products of Orthogonal Double Covers

2013 ◽  
Vol 2013 ◽  
pp. 1-4 ◽  
Author(s):  
R. El Shanawany ◽  
M. Higazy ◽  
A. El Mesady
Keyword(s):  
Cartesian Product ◽  
Bipartite Graphs ◽  
Double Cover ◽  
Cartesian Products ◽  
Double Covers ◽  
Complete Bipartite Graphs ◽  
Orthogonal Double Cover

LetHbe a graph onnvertices and𝒢a collection ofnsubgraphs ofH, one for each vertex, where𝒢is an orthogonal double cover (ODC) ofHif every edge ofHoccurs in exactly two members of𝒢and any two members share an edge whenever the corresponding vertices are adjacent inHand share no edges whenever the corresponding vertices are nonadjacent inH. In this paper, we are concerned with the Cartesian product of symmetric starter vectors of orthogonal double covers of the complete bipartite graphs and using this method to construct ODCs by new disjoint unions of complete bipartite graphs.

Sign in / Sign up

Export Citation Format

Share Document