Signless Laplacian spectral radius and matching in graphs

MaRDI QIDQ6344716zbMATH OpenFDO

Authors Chang Liu, Yingui Pan, Jianping Li

Publication date 8 July 2020

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: The signless Laplacian matrix of a graph $G$ is given by $Q(G)=D(G)+A(G)$, where $D(G)$ is a diagonal matrix of vertex degrees and $A(G)$ is the adjacency matrix. The largest eigenvalue of $Q(G)$ is called the signless Laplacian spectral radius, denoted by $q_1=q_1(G)$. In this paper, some properties between the signless Laplacian spectral radius and perfect matching in graphs are establish. Let $r(n)$ be the largest root of equation $x^3-(3n-7)x^2+n(2n-7)x-2(n^2-7n+12)=0$. We show that $G$ has a perfect matching for $n=4$ or $ngeq10$, if $q_1(G)>r(n)$, and for $n=6$ or $n=8$, if $q_1(G)>4+2sqrt3$ or $q_1(G)>6+2sqrt6$ respectively, where $n$ is a positive even integer number. Moreover, there exists graphs $K_{n-3}vee{K}_{1}veeoverline{K}_2$ such that $q_1(K_{n-3}vee{K}_{1}veeoverline{K}_2)=r(n)$ if $ngeq4$, a graph $K_{2}veeoverline{K}_4$ such that $q_1(K_{2}veeoverline{K}_4)=4+2sqrt3$ and a graph $K_{3}veeoverline{K}_5$ such that $q_1(K_{3}veeoverline{K}_5)=6+2sqrt6$. These graphs all have no prefect matching.

This page was built for publication: Signless Laplacian spectral radius and matching in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6344716)