Title page for etd-0116106-154154


[Back to Results | New Search]

URN etd-0116106-154154
Author Chen-ying Lin
Author's Email Address No Public.
Statistics This thesis had been viewed 5064 times. Download 1981 times.
Department Applied Mathematics
Year 2005
Semester 1
Degree Ph.D.
Type of Document
Language English
Title Dependent Arcs of Orientations of Graphs
Date of Defense 2005-12-24
Page Count 53
Keyword
  • cover graph
  • dependent arc
  • Abstract In this thesis, we focus on the study of dependent arcs of
    acyclic orientations of graphs. Given an acyclic orientation D of G, Edelman cite{West} defined an arc to be {em dependent} if its reversal creates a cycle in D; otherwise, it is independent. Let d(D) and i(D) be the numbers of dependent arcs and independent arcs in D, respectively. And, let d_{max}(G)(d_{min}(G)) and i_{max}(G) (i_{min}(G)) be the maximum (minimum) numbers of dependent arcs and independent
    arcs over all acyclic orientations of G, respectively. Edelman
    cite{Fisher} showed that if G is connected, then
    d_{max}(G)=||G||-|G|+1. A graph G is said to satisfy the
    {em interpolation property} (or G is fully orientable) if $G$
    has an acyclic orientation with exactly k dependent arcs for
    every k with d_{min}(G) leq k leq d_{max}(G). West
    established the interpolation property for complete bipartite graphs cite{West}. We obtain the minimum numbers of dependent arcs of the outerplane graphs and show that the outerplane graphs satisfy the interpolation property. Let N(G) be the set { i(D)| D is an acyclic orientation of G }. N(G) is called the independent-arc spectra of G. For complete k-partite graphs G, we obtain i_{max}(G) and discuss the independent-arc spectra for some classes. On the other hand, we consider the cover problem. A cover graph is the underlying graph of the Hasse diagram of a finite partially ordered set. The cover problem is that whether a given graph is a cover graph. It is easy to see that a graph G is a cover graph if and only if d_{min}(G)=0. We show that the generalized Mycielski graphs M_m(C_{2t+1}) of an odd cycle, Kneser graphs KG(n,k), and Schrijver graphs SG(n,k) are not cover graphs when m geq 1, t geq 1, k geq 3 and n geq 2k+2.
    Advisory Committee
  • Ko-Wei Lih - chair
  • D.J. Guan - co-chair
  • Gerard J. Chang - co-chair
  • Xuding Zhu - co-chair
  • Yeong-Nan Yeh - co-chair
  • B. L. Chen - co-chair
  • Li-Da Tong - advisor
  • Files
  • etd-0116106-154154.pdf
  • indicate access worldwide
    Date of Submission 2006-01-16

    [Back to Results | New Search]


    Browse | Search All Available ETDs

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