Category:Algebraic graph theory

• Algebraic graph theory (computing)

*

• Spectral graph theory (computing)

A

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

B

• Babai's problem (computing)
• Brouwer's conjecture (computing)

C

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

D

• Degree matrix (computing)
• Distance-regular graph (computing)
• Distance-transitive graph (computing)
• Dual graph (computing)

E

• Edge and vertex spaces (computing)
• Edge space (computing)
• Edge-transitive graph (computing)
• Edmonds matrix (computing)

F

• Frucht's theorem (computing)

G

• Graham–Pollak theorem (computing)
• Graph automorphism (computing)
• Graph energy (computing)

H

• Hafnian (computing)
• Half-transitive graph (computing)
• Hierarchical closeness (computing)

I

• Ihara zeta function (computing)
• Incidence matrix (computing)
• Integral graph (computing)

K

• Kirchhoff's theorem (computing)

L

• Laplacian matrix (computing)
• Lovász conjecture (computing)

M

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

P

• Parry–Sullivan invariant (computing)

R

• Ramanujan graph (computing)
• Rank (graph theory) (computing)

S

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

T

• Tutte matrix (computing)
• Two-graph (computing)

V

• Vertex-transitive graph (computing)

W

• Walk-regular graph (computing)

Z

• Zero-symmetric graph (computing)