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
Multiplicities of distance Laplacian eigenvalues and forbidden subgraphs
Sign Up to like & getrecommendations! Published in 2018 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2017.11.031
Abstract: Abstract In this work, the graphs of order n having the second distance Laplacian eigenvalue of multiplicity n − 2 are determined. Besides that, this result also characterizes the graphs where the multiplicity of some… read more here.
Keywords: multiplicity; multiplicities distance; laplacian eigenvalues; distance laplacian ... See more keywords
On the Sum and Spread of Reciprocal Distance Laplacian Eigenvalues of Graphs in Terms of Harary Index
Sign Up to like & getrecommendations! Published in 2022 at "Symmetry"
DOI: 10.3390/sym14091937
Abstract: The reciprocal distance Laplacian matrix of a connected graph G is defined as RDL(G)=RT(G)−RD(G), where RT(G) is the diagonal matrix of reciprocal distance degrees and RD(G) is the Harary matrix. Clearly, RDL(G) is a real… read more here.
Keywords: rdl rdl; distance laplacian; distance; laplacian eigenvalues ... See more keywords