Photo by heftiba from unsplash
A fractional matching of a graph G is a function f: $$E(G)\rightarrow [0, 1]$$ such that for each vertex v, $$\sum \nolimits _{e \epsilon \Gamma _G (v)}f(e)\hbox {\,\,\char 054\,\,}1$$ .… Click to show full abstract
A fractional matching of a graph G is a function f: $$E(G)\rightarrow [0, 1]$$ such that for each vertex v, $$\sum \nolimits _{e \epsilon \Gamma _G (v)}f(e)\hbox {\,\,\char 054\,\,}1$$ . The fractional matching number of G is the maximum value of $$\sum _{e\in E(G)}f(e)$$ over all fractional matchings f. Tian et al. (Linear Algebra Appl 506:579–587, 2016) determined the extremal graphs with minimum distance Laplacian spectral radius among n-vertex graphs with given matching number. However, a natural problem is left open: among all n-vertex graphs with given fractional matching number, how about the lower bound of their distance Laplacian spectral radii and which graphs minimize the distance Laplacian spectral radii? In this paper, we solve these problems completely.
Journal Title: Journal of the Operations Research Society of China
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!