Fractional matching number and spectral radius of nonnegative matrix of graphs
Abstract
A fractional matching of a graph G is a function f:E(G) [0,1] such that for any v∈ V(G), Σe∈ EG(v)f(e)≤ 1 where EG(v) = \e ∈ E(G): e is incident with v in G\. The fractional matching number of G is μf(G) = \Σe∈ E(G) f(e): f is fractional matching of G\. For any real numbers a 0 and k ∈ (0, n), it is observed that if n = |V(G)| and δ(G) > n-k2, then μf(G)>n-k2. We determine a function (a, n,δ, k) and show that for a connected graph G with n = |V(G)|, δ(G) ≤n-k2, spectral radius λ1(G) and complement G, each of the following holds. (i) If λ1(aD(G)+A(G))<(a, n, δ, k), then μf(G)>n-k2. (ii) If λ1(aD(G)+A(G))<(a+1)(δ+k-1), then μf(G)>n-k2. As corollaries, sufficient spectral condition for fractional perfect matchings and analogous results involving Q-index and Aα-spectral radius are obtained, and former spectral results in [European J. Combin. 55 (2016) 144-148] are extended.