Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs
type: Item
instance of: scholarly article
title: Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs
zbMATH Open document ID: 1145.05312
author: Chang-Hsiung Tsai
author: Tseng-Kui Li
published in: Mathematical and Computer Modelling
publication date: 2008-10-21T00:00:00Z
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 5354833
zbMATH Keywords: interconnection network
zbMATH Keywords: graph theorem
zbMATH Keywords: Hamiltonian 1-node-Hamiltonian
zbMATH Keywords: Hamiltonian cycle
zbMATH Keywords: fault tolerance
MaRDI profile type: Publication
full work available at URL: j.mcm.2007.11.015
OpenAlex ID: W1967288240
cites work: Flip-Flops in Hypohamiltonian Graphs
cites work: New flip-flop constructions for hypohamiltonian graphs
cites work: Parallel concepts in graph theory
cites work: Edge fault tolerance in graphs
cites work: Q4887730
cites work: Christmas tree: a versatile 1-fault-tolerant design for token rings
cites work: Hamiltonian graphs with minimum number of edges for fault-tolerant topologies
cites work: Optimal 1-Hamiltonian graphs
cites work: Construction schemes for fault-tolerant Hamiltonian graphs
DOI: 10.1016/J.MCM.2007.11.015
description: scientific article; zbMATH DE number 5354833