Applied Mathematics and Nonlinear Sciences
Journal license

Journal

Applied Mathematics and Nonlinear Sciences


Volume
& Issue

Volume 3, Issue 2


Published
on

December 7, 2018


Pages

419-426


DOI

Article

Hamilton-connectivity of Interconnection Networks Modeled by a Product of Graphs

Check for updates


Authors

Donglin Liu Affiliation:
School of Mechanical and Electronic Engineering, Wuhan University of Technology, Wuhan, PR China
, Chunxiang Wang Affiliation:
Faculty of Mathematics and Statistics, Central China Normal University, Wuhan 430079, P.R. China
and Shaohui Wang Affiliation:
Department of Mathematics, Savannah State University, GA 31404, Savannah, USA


Abstract

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 (Δ,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

panconnected, fault-hamiltonicity, fault tolerance, interconnection networks, 05C40, 05c45


Citation

Liu, D., Wang, C., & Wang, S. (2018). Hamilton-connectivity of interconnection networks modeled by a product of graphs. Applied Mathematics and Nonlinear Sciences, 3(2), 419–426. https://doi.org/10.21042/AMNS.2018.2.00032

Published by: Engineering Journals

Engineering Journals Logo