Hamiltonian-Laceability of Star Graphs

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Sun-yuan Hsieh Articles by Gen-huey Chen Articles by Chin-wen Ho

1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97)

Taipei, Taiwan

December 18-December 20

ISBN: 0-8186-8259-0

	ASCII Text	x
	Sun-yuan Hsieh, Gen-huey Chen, Chin-wen Ho, "Hamiltonian-Laceability of Star Graphs," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 112, 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 1997.

	BibTex	x
	@article{ 10.1109/ISPAN.1997.645079, author = {Sun-yuan Hsieh and Gen-huey Chen and Chin-wen Ho}, title = {Hamiltonian-Laceability of Star Graphs}, journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on}, volume = {0}, year = {1997}, issn = {1087-4089}, pages = {112}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.1997.645079}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel Architectures, Algorithms, and Networks, International Symposium on TI - Hamiltonian-Laceability of Star Graphs SN - 1087-4089 SP EP A1 - Sun-yuan Hsieh, A1 - Gen-huey Chen, A1 - Chin-wen Ho, PY - 1997 VL - 0 JA - Parallel Architectures, Algorithms, and Networks, International Symposium on ER -

Sun-yuan Hsieh, National Taiwan University, Taiwan

Gen-huey Chen, National Taiwan University, Taiwan

Chin-wen Ho, National Central Unversity, Taiwan

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.1997.645079

Suppose G is a bipartite graph with two partite sets of equal size. G is said to be strongly hamiltonlaceable if there is a hamiltonian path between any two vertices that belong to the different partite sets, and there is a path of (maximal) length N-2 between any two vertices that belong to the same partite set, where N is the order of G. The star graph is known to be bipartite. In this paper, we show that the n-dimensional star graph, where n\geq 4 is strongly hamiltonian-laceable.

Citation:

Sun-yuan Hsieh, Gen-huey Chen, Chin-wen Ho, "Hamiltonian-Laceability of Star Graphs," ispan, pp.112, 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 1997

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.