2000 character limit reached
Laplacian integrality in P4-sparse and P4-extendible graphs (1611.08271v1)
Published 24 Nov 2016 in cs.DM and math.CO
Abstract: Let G be a simple graph and L = L(G) the Laplacian matrix of G. G is called L-integral if all its Laplacian eigenvalues are integer numbers. It is known that every cograph, a graph free of P4, is L-integral. The class of P4-sparse graphs and the class of P4-extendible graphs contain the cographs. It seems natural to investigate if the graphs in these classes are still L-integral. In this paper we characterized the L-integral graphs for both cases, P4-sparse graphs and P4-extendible graphs.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.