Paula Rama

Laplacian eigenvectors and eigenvalues and almost equitable partitions

Relations between Laplacian eigenvectors and eigenvalues and the existence of almost equitable partitions (which are generalizations of equitable partitions) are presented. Furthermore, on the basis of some properties of the adjacency eigenvectors of a graph, a necessary and sufficient condition for the graph to be primitive strongly regular is introduced.

Extremal graphs for the sum of the two largest signless Laplacian eigenvalues

Let G be a simple graph on

Modelling the problem of food distribution by the Portuguese food banks

n

A recursive construction of the regular exceptional graphs with least eigenvalue –2

vertices and

Equitable Bipartitions of Graphs and Related Results

e(G)

Spectral results on regular graphs with (k,τ)-regular sets

edges. Consider

Spectral results on graphs with regularity constraints

Q(G) = D + A

Integral graphs and (k, τ)-regular sets

as the signless Laplacian of

The modified Schultz index of graph operations

G

Lexicographic polynomials of graphs and their spectra

, where