Construction of the enormous complete bipartite graphs and orthogonal double covers based on the Cartesian product

2021 ◽  
Author(s):  
A. El-Mesady ◽  
T. Farahat ◽  
R. El-Shanawany
Keyword(s):  
Cartesian Product ◽  
Bipartite Graphs ◽  
Double Covers ◽  
Complete Bipartite Graphs

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.

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 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.

Sign in / Sign up

Export Citation Format

Share Document