Hamilton-connectivity of Interconnection Networks Modeled by a Product of Graphs
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...
Main Authors: | Liu Donglin, Wang Chunxiang, Wang Shaohui |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2018-12-01
|
Series: | Applied Mathematics and Nonlinear Sciences |
Subjects: | |
Online Access: | https://doi.org/10.21042/AMNS.2018.2.00032 |
Similar Items
-
Toughness, Forbidden Subgraphs, and Hamilton-Connected Graphs
by: Zheng Wei, et al.
Published: (2022-02-01) -
Hamilton Cycles in Double Generalized Petersen Graphs
by: Sakamoto Yutaro
Published: (2019-02-01) -
On Implicit Heavy Subgraphs and Hamiltonicity of 2-Connected Graphs
by: Zheng Wei, et al.
Published: (2021-02-01) -
A Note on Cycles in Locally Hamiltonian and Locally Hamilton-Connected Graphs
by: Tang Long, et al.
Published: (2020-02-01) -
Generalized 4-connectivity of hierarchical star networks
by: Wang Junzhen, et al.
Published: (2022-10-01)