Lower Bounds of Distance Laplacian Spectral Radii of n-Vertex Graphs in Terms of Fractional Matching Number
Sign Up to like & getrecommendations! Published in 2021 at "Journal of the Operations Research Society of China"
DOI: 10.1007/s40305-021-00358-5
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… read more here.
Keywords: distance laplacian; fractional matching; laplacian spectral; matching number ... See more keywords