A note about some properties of BC graphs

DOI10.1016/J.IPL.2008.07.014MaRDI QIDQ975502zbMATH OpenOpenAlexFDO

Authors Xuegong Tan, Shun-Zheng Yu, Jin Han Park

Publication date 9 June 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2008.07.014

zbMATH Keywords

interconnection networksvertex-pancyclicitysuper-connectivityBC graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites work

• scientific article; zbMATH DE number 3735859 (Why is no real title available?)
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• Hamiltonian properties on the class of hypercube-like networks
• Maximum number of edges joining vertices on a cube
• Routing properties of supercubes
• The Mobius cubes
• The locally twisted cubes

Cited in

(9)

• Reliability of m-ary n-dimensional hypercubes under embedded restriction
• On the t/k-diagnosability of BC networks
• Sets of binary sequences with small total Hamming distances
• A note on minimum linear arrangement for BC graphs
• Edge-fault tolerance of hypercube-like networks
• Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model
• The congestion of generalized cube communication pattern in linear array network
• Embedding algorithm of spined cube into grid structure and its wirelength computation
• Adaptive diagnosis of Hamiltonian networks under the comparison model

This page was built for publication: A note about some properties of BC graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975502)