Please use this identifier to cite or link to this item: https://ir.swu.ac.th/jspui/handle/123456789/15434
ชื่อเรื่อง: The Hamiltonian number of graphs with prescribed connectivity
ผู้แต่ง: Thaithae S.
Punnim N.
วันที่เผยแพร่: 2009
บทคัดย่อ: A Hamiltonian walk in a connected graph G is a closed walk of minimum length which contains every vertex of G. The Hamiltonian number h(G) of a connected graph G is the length of a Hamiltonian walk in G. Let G(n) be the set of all connected graphs of order n, G(n, k = k) be the set of all graphs in G(n) having connectivity k = k, and h(n, k) = {h(G) : G ∈ G(n, k = k)}. We prove in this paper that for any pair of integers n and k with 1 ≤ k ≤ n - 1, there exist positive integers a := min(h; n, k) = min{h(G) : G ∈ G(n, k = k)} and b := max(h; n, k) = max{h(G) : G ∈ G(n, k = k)} such that h(n, k) = {x ∈ ℤ : a ≤ x ≤ b}. The values of min(h; n, k) and max(h; n, k) are obtained in all situations.
URI: https://ir.swu.ac.th/jspui/handle/123456789/15434
https://www.scopus.com/inward/record.uri?eid=2-s2.0-60749098731&partnerID=40&md5=d29fcdf7cf12ce5b6baf9d5c549a7050
ISSN: 3817032
Appears in Collections:Scopus 1983-2021

Files in This Item:
There are no files associated with this item.


Items in SWU repository are protected by copyright, with all rights reserved, unless otherwise indicated.