The Upper Bound for the Largest Signless Laplacian Eigenvalue of Weighted Graphs

In this study, we find an upper bound for the largest signless Laplacian eigenvalue of simple connected weighted graphs, where the edge weights are positive definite square matrices. Also we obtain some results on weighted and unweighted graphs by using this bound.