Hamilton-connectivity of Interconnection Networks Modeled by a Product of Graphs
Open Access
- 1 July 2018
- journal article
- Published by Erdos Publish House in Applied Mathematics and Nonlinear Sciences
- Vol. 3 (2) , 419-426
Abstract
The product graph G m *G p of two given graphs G m and G p , defined by J.C. Bermond et al.[J Combin Theory, Series B 36(1984) 32-48] in the context of the so-called ( Δ,D )-problem, is one interesting model in the design of large reliable networks. This work deals with sufficient conditions that guarantee these product graphs to be hamiltonian-connected. Moreover, we state product graphs for which provide panconnectivity of interconnection networks modeled by a product of graphs with faulty elements.Keywords
This publication has 12 references indexed in Scilit:
- On extremal multiplicative Zagreb indices of trees with given domination numberApplied Mathematics and Computation, 2018
- On the sharp lower bounds of Zagreb indices of graphs with given number of cut verticesJournal of Mathematical Analysis and Applications, 2018
- The Domination Complexity and Related Extremal Values of Large 3D TorusComplexity, 2018
- A note on the independent domination number versus the domination number in bipartite graphs2017
- Odd mean labeling for two star graphApplied Mathematics and Nonlinear Sciences, 2017
- Some new standard graphs labeled by 3–total edge product cordial labelingApplied Mathematics and Nonlinear Sciences, 2017
- ( β ,α ) − Connectivity Index of GraphsApplied Mathematics and Nonlinear Sciences, 2017
- A generalization of a result of Bauer and SchmeichelGraphs and Combinatorics, 1993
- Large graphs with given degree and diameter. IIJournal of Combinatorial Theory, Series B, 1984
- Graph Theory with Applications1976