Abstract
Let 1 ≤ a < b be integers and G a graph of order n sufficiently large for a and b. Then G has an [ a , b ] -factor if the minimum degree is at least a and every pair of vertices distance two apart has cardinality of the neighborhood union at least an / ( a + b ) . This lower bound is sharp. As a consequence, we have a Fan-type condition for a graph to have an [ a , b ] -factor.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
