Please use this identifier to cite or link to this item: https://ir.swu.ac.th/jspui/handle/123456789/14909
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPunnim N.
dc.date.accessioned2021-04-05T04:32:06Z-
dc.date.available2021-04-05T04:32:06Z-
dc.date.issued2007
dc.identifier.issn10344942
dc.identifier.other2-s2.0-70349976760
dc.identifier.urihttps://ir.swu.ac.th/jspui/handle/123456789/14909-
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-70349976760&partnerID=40&md5=dfe2e9d2fdd444c192f97b5076a2fb03
dc.description.abstractFor positive integers m and n (1 ≤ m ≤ (n 2)), let Jm(n) be the class of all distinct subgraphs of Kn of size m. Let G,H ∈ Im(n). Then G is said to be obtained from H by an edge jump if there exist four distinct vertices u,v,w, and x of Kn such that e = uv ∉ E(H), f = wx ∈ E(H) and σ(e,f)H:= H + e -/= G. The minimum number of edge jumps required to transform H to G is the jump distance from H to G. The graph Jm(n) is that graph having Jm(n) as its vertex set where two vertices of Jm(n) are adjacent if and only if the jump distance between the corresponding subgraphs is 1. Let ℂm(n) be the subset of Jm(n) consisting of all connected graphs. We prove in this paper that the graph Jm(n) is connected and the subgraph of the graph Jm(n) induced by ℂm(n) is also connected. Several graph parameters are proved to interpolate over the class Jm(n) and ℂm (n). Algorithms for determining the extreme values for the chromatic number X and the clique number are also provided.
dc.titleInterpolation theorems in jump graphs
dc.typeArticle
dc.rights.holderScopus
dc.identifier.bibliograpycitationAustralasian Journal of Combinatorics. Vol 39, No.1 (2007), p.103-114
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.