Title: A degree condition for graphs to have[a,b]-factors
Abstract: A graph is called K 1,n free if it contains no K 1,n as an induced subgraph.Let G be a graph with vertex set V(G) .Let n(≥3) , a and b be integers such that b≥a≥1 ,and if b is odd, b≥n-1 .We prove that every K 1,n free connected graph G with b|V(G)| even has an factor if its minimum degree is at least a+n-1,|V(G)|≥{(a+b)(a+b-1)+1}/b ,and max {d G(x),d G(y)}≥a|V(G)|/(a+b),for any two non adjacent vertices x and y of V(G) .
Publication Year: 2002
Publication Date: 2002-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot