Graphs and Hermitian matrices: exact interlacing

Graphs and matrices of maximal energy

Graphs having many holes but with small competition numbers

Graphs having no quantum symmetry

Graphs of 2-torus actions

Graphs of Maps

Graphs of Small Rank-width are Pivot-minors of Graphs of Small Tree-width

Graphs of Transportation Polytopes

Graphs of unitary matrices

Graphs where every k-subset of vertices is an identifying set

Graphs which their certain polynomials have few distinct roots- a survey

Graphs whose flow polynomials have only integral roots

Graphs whose normalized Laplacian has three eigenvalues

Graphs with bounded tree-width and large odd-girth are almost bipartite

Graphs with chromatic roots in the interval (1,2)

Graphs with Diameter $n-e$ Minimizing the Spectral Radius

Graphs with extremal energy should have a small number of distinct eigenvalues

Graphs with Given Degree Sequence and Maximal Spectral Radius

Graphs with large generalized 3-connectivity

Graphs with large generalized 3-edge-connectivity