Return to search

線星數極值問題 / Extremal Problems for Linear Star Number

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.

Identiferoai:union.ndltd.org:CHENGCHI/A2002001137
Creators劉宣谷
Publisher國立政治大學
Source SetsNational Chengchi University Libraries
Language英文
Detected LanguageEnglish
Typetext
RightsCopyright © nccu library on behalf of the copyright holders

Page generated in 0.0016 seconds