Hamilton-connectivity of interconnection networks modeled by a product of graphs

DOI10.21042/AMNS.2018.2.00032WikidataQ128729241 ScholiaQ128729241MaRDI QIDQ2690609

Shaohui Wang, Chunxiang Wang, Donglin Liu

Publication date: 17 March 2023

Published in: Applied Mathematics and Nonlinear Sciences (Search for Journal in Brave)

zbMATH Keywords

fault toleranceinterconnection networkspanconnectedfault-Hamiltonicity

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Analysis of fractional factor system for data transmission in SDN ⋮ The extension degree conditions for fractional factor ⋮ Parameters and fractional factors in different settings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large graphs with given degree and diameter. II
• A generalization of a result of Bauer and Schmeichel
• On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices
• The domination complexity and related extremal values of large 3D torus
• On extremal multiplicative Zagreb indices of trees with given domination number
• A sufficient condition for the existence of a k-factor excluding a given r-factor
• (β ,α)−Connectivity Index of Graphs
• Some new standard graphs labeled by 3–total edge product cordial labeling
• Odd mean labeling for two star graph
• A note on the independent domination number versus the domination number in bipartite graphs

This page was built for publication: Hamilton-connectivity of interconnection networks modeled by a product of graphs