The characteristic polynomial of the Laplacian of graphs in (a,b)-linear classes

By Carla Silva Oliveira, N. Abreu, Samuel Jurkiewicz. 2002

57 citations recorded by the source corpus.

In this work we deal with the characteristic polynomial of the Laplacian of a graph. We present some general results about the coefficients of this polynomial. We present families of graphs, for which the number of edges m is given by a linear function of the number of vertices n. In some of these graphs we can find certain coefficients of the above-named polynomial as functions just of n.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/e5f43107b053132d5ea376997b94dadabbcbeb2b

Citations in the corpus

• EIGENVALUE BOUNDS FOR THE SIGNLESS LAPLACIAN (2007, unknown): “Note that results concerning such coefficients for some other classes of graphs, in particular for trees, have been obtained in [20].”