Landau's and Rado's theorems and partial tournaments.
Laplacian integral graphs with maximum degree 3.
Laplacian matrix and distance in trees
Laplacian of graphs and algebraic connectivity
Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences.
Le trou spectral des graphes et leurs propriétés d'expansion
Limit points for normalized Laplacian eigenvalues.
Limit points of eigenvalues of (di)graphs
The study on limit points of eigenvalues of undirected graphs was initiated by A. J. Hoffman in 1972. Now we extend the study to digraphs. We prove: 1. Every real number is a limit point of eigenvalues of graphs. Every complex number is a limit point of eigenvalues of digraphs. 2. For a digraph , the set of limit points of eigenvalues of iterated subdivision digraphs of is the unit circle in the complex plane if and only if has a directed cycle. 3. Every limit point of eigenvalues of a set...
Line graphs: their maximum nullities and zero forcing numbers
The maximum nullity over a collection of matrices associated with a graph has been attracting the attention of numerous researchers for at least three decades. Along these lines various zero forcing parameters have been devised and utilized for bounding the maximum nullity. The maximum nullity and zero forcing number, and their positive counterparts, for general families of line graphs associated with graphs possessing a variety of specific properties are analysed. Building upon earlier work, where...
Line Graphs with Exactly two Positive Eigenvalues
Linear combinations of graph eigenvalues.
Low rank co-diagonal matrices and Ramsey graphs.
Lower bound for the norm of a vertex-transitive graph.
Lower Bounds for Estrada Index