English

Fractional matching number and spectral radius of nonnegative matrix of graphs

Combinatorics 2020-02-04 v1

Abstract

A fractional matching of a graph GG is a function f:E(G)[0,1]f:E(G) \to [0,1] such that for any vV(G)v\in V(G), eEG(v)f(e)1\sum_{e\in E_G(v)}f(e)\leq 1 where EG(v)={eE(G):eE_G(v) = \{e \in E(G): e is incident with vv in G}G\}. The fractional matching number of GG is μf(G)=max{eE(G)f(e):f\mu_{f}(G) = \max\{\sum_{e\in E(G)} f(e): f is fractional matching of G}G\}. For any real numbers a0a \ge 0 and k(0,n)k \in (0, n), it is observed that if n=V(G)n = |V(G)| and δ(G)>nk2\delta(G) > \frac{n-k}{2}, then μf(G)>nk2\mu_{f}(G)>\frac{n-k}{2}. We determine a function φ(a,n,δ,k)\varphi(a, n,\delta, k) and show that for a connected graph GG with n=V(G)n = |V(G)|, δ(G)nk2\delta(G) \leq\frac{n-k}{2}, spectral radius λ1(G)\lambda_1(G) and complement G\overline{G}, each of the following holds. (i) If λ1(aD(G)+A(G))<φ(a,n,δ,k),\lambda_{1}(aD(G)+A(G))<\varphi(a, n, \delta, k), then μf(G)>nk2.\mu_{f}(G)>\frac{n-k}{2}. (ii) If λ1(aD(G)+A(G))<(a+1)(δ+k1),\lambda_{1}(aD(\overline{G})+A(\overline{G}))<(a+1)(\delta+k-1), then μf(G)>nk2.\mu_{f}(G)>\frac{n-k}{2}. As corollaries, sufficient spectral condition for fractional perfect matchings and analogous results involving QQ-index and AαA_{\alpha}-spectral radius are obtained, and former spectral results in [European J. Combin. 55 (2016) 144-148] are extended.

Keywords

Cite

@article{arxiv.2002.00370,
  title  = {Fractional matching number and spectral radius of nonnegative matrix of graphs},
  author = {Ruifang Liu and Hong-Jian Lai and Litao Guo and Jie Xue},
  journal= {arXiv preprint arXiv:2002.00370},
  year   = {2020}
}