Hamiltonian Laceability of Spider Web Networks

2005中原學報Biochemistry, Genetics and Molecular Biology被引 16

摘要

In this paper, we prove the recently proposed family of bipartite graphs, Spider Web Networks [9], are hamiltonian laceable. More precisely, let G=(V, E) be a spider web network with bipartitions C and D. For any pair of nodes {x, y| x∈C, y∈D}, there is a path P between x and y where P visits all nodes in V exactly once.

引用本文（GB/T 7714）

Shin-Shin Kao, Lih‐Hsing Hsu. Hamiltonian Laceability of Spider Web Networks[J]. 中原學報, 2005.

引文网络

参考文献与被引分析加载中…

DOI：https://doi.org/10.6358/jcyu.200503.0001

本站仅收录题录与摘要供学习参考，全文版权归属出版方；如有侵权请联系我们删除。