In this thesis, we study relationships between linear star number and star number and obtain bounds on the linear star number. We obtain an upper bound on linear star number in term of star number：s*(G) ≦ 3s(G). When we forbid certain induced subgraphs, we obtain an upper bound on linear star number. If G is a graph without induced K4－e., we prove that s*(G) ≦ s(G)+1. And, the linear star number of the triangle-free graph is also bounded by s(G)+1. The linear star number and star number are equal when G is a graph with △(G)=3. When G is a graph with △(G)=4, we also obtain s*(G)≦s(G)+1.

BOOK{texbook, author = {Douglas B. West}, year = 1996, title = {Introduction to Graph Theory}, publisher = {PRENTICE HALL} }
ARTICLE{Gav, author={F. Gavril}, title={The intersection graphs of subtrees in trees are exactly the chordal graphs}, journal={J. Combinatorics Theory B}, volume={16}, year={1974}, pages={45-56},}
ARTICLE{Bun, author={P.A. Buneman}, title={A characterization of rigid circuit graphs}, journal={Discrete Math}, volume={9}, year={1974}, pages={205-212}, }
ARTICLE{Wal, author={J.R. Walter}, title={Representations of chordal graphs as subtrees of a tree}, journal={J. Graph Theory}, volume={2}, year={1978}, pages={265-267},}
ARTICLE{Wes, author={D.B. West}, title={Parameters in partial orders and graphs:Packing, covering, and representation}, journal={Graphs and Order}, volume={2}, year={1985}, pages={267-350},}
PHDTHESIS{Chang, author={Yi-Wu Chang}, title={Graph Representations Using Star, Tree, Intervals And Boxes}, school={M.S., University of Illinois}, year={1994},}