Hamilton-connectivity of Interconnection Networks Modeled by a Product of Graphs
- Autores: Donglin Liu, Chunxiang Wang, Zhaohui Wang
- Localización: Applied Mathematics and Nonlinear Sciences, ISSN-e 2444-8656, Vol. 3, Nº. 2, 2018, págs. 419-426
- Idioma: inglés
- DOI: 10.21042/amns.2018.2.00032
- Enlaces
-
Resumen
The product graph Gm ∗ Gp of two given graphs Gm and Gp, defined by J.C. Bermond et al.[J Combin Theory, Series B 36(1984) 32-48] in the context of the so-called (4,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
¿Es nuevo? Regístrese
Ventajas de registrarse
