• Algebraic graph theory

*

• Spectral graph theory

A

• Adjacency algebra
• Adjacency matrix
• Algebraic connectivity
• Alon–Boppana bound
• Alpha centrality

B

• Babai's problem
• Brouwer's conjecture

C

• Centrality
• Clustering coefficient
• Complex network zeta function
• Conductance (graph theory)
• Conference graph
• Conference matrix
• Cycle basis
• Cycle space

D

• Degree matrix
• Distance-regular graph
• Distance-transitive graph
• Dual graph

E

• Edge and vertex spaces
• Edge-transitive graph
• Edmonds matrix
• Elementary Number Theory, Group Theory and Ramanujan Graphs
• Expander mixing lemma

F

• Frucht's theorem

G

• Graham–Pollak theorem
• Graph automorphism
• Graph energy

H

• Hafnian
• Half-transitive graph
• Hierarchical closeness

I

• Ihara zeta function
• Incidence matrix
• Integral graph

J

• Jordan–Pólya number

K

• Katz centrality
• Kirchhoff's theorem

L

• Laplacian matrix
• Lovász conjecture

M

• Mac Lane's planarity criterion
• Matching polynomial
• Minimum rank of a graph
• Modularity (networks)

P

• Parry–Sullivan invariant

R

• Ramanujan graph
• Rank (graph theory)

S

• Seidel adjacency matrix
• Semi-symmetric graph
• Sims conjecture
• Spectral clustering
• Strongly regular graph
• Symmetric graph

T

• Tutte matrix
• Two-graph

V

• Vertex-transitive graph

W

• Walk-regular graph

Z

• Zero-symmetric graph