Distance signless Laplacian spectral radius and perfect matching in graphs and bipartite graphs

arXiv2104.01288MaRDI QIDQ6364451FDOQ6364451

Jianping Li, Chang Liu

Publication date: 2 April 2021

Abstract: The distance matrix $mathcalD$ of a connected graph $G$ is the matrix indexed by the vertices of $G$ which entry $mathcal{D}_{i,j}$ equals the distance between the vertices $v_i$ and $v_j$. The distance signless Laplacian matrix $mathcalQ(G)$ of graph $G$ is defined as $mathcalQ(G)=Diag(Tr)+mathcalD(G)$, where $Diag(Tr)$ is the diagonal matrix of the vertex transmissions in $G$. The largest eigenvalue of $mathcalQ(G)$ is called the distance signless Laplacian spectral radius of $G$, written as $et{a}_1(G)$. And a perfect matching in a graph is a set of disadjacent edges covering every vertex of $G$. In this paper, we present two suffcient conditions in terms of the distance signless Laplacian sepectral radius for the exsitence of perfect matchings in graphs and bipatite graphs.

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)

This page was built for publication: Distance signless Laplacian spectral radius and perfect matching in graphs and bipartite graphs

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