Title page for etd-0728105-104156


[Back to Results | New Search]

URN etd-0728105-104156
Author Pei-lan Yen
Author's Email Address yenpl@math.nsysu.edu.tw
Statistics This thesis had been viewed 5063 times. Download 1790 times.
Department Applied Mathematics
Year 2004
Semester 2
Degree Master
Type of Document
Language English
Title The Convexity Spectra and the Strong Convexity Spectra of Graphs
Date of Defense 2005-05-27
Page Count 26
Keyword
  • Convex set
  • convexity number
  • convexity spectrum
  • complete graph
  • Abstract Given a connected oriented graph D, we say that a subset S of V(D) is convex in D if, for every pair of vertices x, y in S, the vertex set of every x-y geodesic (x-y shortest dipath) and y-x geodesic in D is contained in S. The convexity number con (D) of a nontrivial connected oriented graph D is the maximum cardinality of a proper convex set of D.
    Let S_{C}(K_{n})={con(D)|D is an orientation of K_{n}} and S_{SC}(K_{n})={con(D)|D is a strong orientation of K_{n}}. We show that S_{C}(K_{3})={1,2} and S_{C}(K_{n})={1,3,4,...,n-1} if n >= 4. We also have that S_{SC}(K_{3})={1} and S_{SC}(K_{n})={1,3,4,...,n-2} if n >= 4 .
    We also show that every triple n, m, k of integers with n >= 5, 3 <= k <= n-2, and n+1 <= m <= n(n-1)/2, there exists a strong connected oriented graph D of order n with |E(D)|=m and con (D)=k.
    Advisory Committee
  • Xuding Zhu - chair
  • Sen-Peng Eu - co-chair
  • Tsai-Lien Wong - co-chair
  • Li-Da Tong - advisor
  • Files
  • etd-0728105-104156.pdf
  • indicate access worldwide
    Date of Submission 2005-07-28

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys