Sharp Upper Bounds for the Laplacian Spectral Radius of Graphs

<table>The graph <svg height="12.875" id="M112" style="vertical-align:-0.23206pt" version="1.1" viewbox="0 0 13.55 12.875" width="13.55" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.625,11.963)"><path d="M713 296l-5 -25q-47 -7 -59 -20t-23 -72l-15 -79q-9 -48 -3 -74q-15 -3 -55 -13t-63 -15t-59.5 -10t-70.5 -5q-149 0 -243 80t-94 220q0 169 127.5 276.5t336.5 107.5q91 0 206 -36l-10 -165l-29 -1q1 85 -47.5 126t-146.5 41q-153 0 -243.5 -97t-90.5 -242
q0 -122 68.5 -198.5t188.5 -76.5q121 0 139 75l20 86q13 58 -1.5 70.5t-99.5 20.5l5 26h267z" id="x1D43A"></path></g>
</svg> on 6 vertices.</table>

Mathematical Problems in Engineering

fig1

Figure 1

Figure 1: Sharp Upper Bounds for the Laplacian Spectral Radius of Graphs 