The spectral radius of graphs with fractional matching number

arXiv2303.05885MaRDI QIDQ6429093FDOQ6429093

Authors: Qian-Qian Chen, Jiming Guo 

Publication date: 10 March 2023

Abstract: Let $$ $$ be the set of all (connected) graphs of order $n$ with fractional matching number $$. In this paper, the graphs with maximal spectral radius in $$ and $$ are characterized, respectively. Moreover, a lower bound for the spectral radius in graphs with order $n$ to guarantee the existence of a perfect fractional matching is also given, which generalizes the main result of O [Suil O, Spectral radius and matchings in graphs, Linear Algebra and its Applications, 2020].

This page was built for publication: The spectral radius of graphs with fractional matching number

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