2000 character limit reached
New Bounds for the Laplacian Spectral Radius of a Signed Graph (1103.4629v1)
Published 23 Mar 2011 in math.CO
Abstract: We obtain new bounds for the Laplacian spectral radius of a signed graph. Most of these new bounds have a dependence on edge sign, unlike previously known bounds, which only depend on the underlying structure of the graph. We then use some of these bounds to obtain new bounds for the Laplacian and signless Laplacian spectral radius of an unsigned graph by signing the edges all positive and all negative, respectively.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.