Abstract
AbstractWe first establish a lower bound on the size and spectral radius of a graph G to guarantee that G contains a fractional perfect matching. Then, we determine an upper bound on the distance spectral radius of a graph G to ensure that G has a fractional perfect matching. Furthermore, we construct some extremal graphs to show all the bounds are best possible.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have