Algebraic Graph Theory
By A. Ashrafi, M. J. Nadjafi-Arani. 2026
8,709 citations recorded by the source corpus.
This note provides an introduction to selected topics in algebraic graph theory, including strongly regular graphs, Steiner systems, and automorphism groups. We describe constructions and properties of notable graphs such as the Petersen graph, Paley graphs, Hamming graphs, and the Hoffman-Singleton graph, with emphasis on their symmetry and combinatorial structure. Connections with permutation groups are also discussed. Computational examples using SageMath are included to illustrate key concepts and to compute automorphism groups and related invariants.
Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Ivan Gutman
- Richard A. Brualdi
- Wei Ren
- Boris Furtula
- Dimos V. Dimarogonas
- Youfeng Su
- Matthew Baker
- Yongtang Shi
In Discrete Mathematics and Combinatorics
- Vladimir Nikiforov
- Richard A. Brualdi
- Sebastian M. Cioaba
- Ivan Gutman
- Caiheng Li
- Alex Arenas
- H. Sahlmann
- Maurizio Porfiri
In Geometry and Topology
- Ivan Gutman
- Richard A. Brualdi
- Wei Ren
- Matthew Baker
- Boris Furtula
- Alex Arenas
- M. A. Porter
- Vladimir Nikiforov
Citations in the corpus
- An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination (2012, methodology): “us behavior [7], [9], [10]. 3) Different Approaches (Lyapunov Method versus Stochastic Matrix Theory). Since both complex networks and multiagent systems are networked systems, algebraic graph theory [101] is a common approach to use. Because of the nonlinear terms in synchronization of complex netw”
- Estimating the Spectral Density of Large Implicit Matrices (2018, background): “For a more detailed discussion of Kneser graphs, see Godsil and Royle (2001).”
- On a conjecture about edge irregular total labelings (2008, neutral): “[5]).”
- Spectra of digraphs (2010, background): “[33,49]) and focus on digraphs that are not assumed to be symmetric.”
- Optimal fractional repetition codes and fractional repetition batch codes (2015, methodology): “Similarly to an FR code CG with ρ = 2 based on a graph G with girth g, we consider an FR code CGP based on a generalized g-gon (generalized polygon GP [3]) for ρ > 2.”
- On Laplacian-energy-like invariant of a graph < (2012, background): “It follows from the fact that the number of distinct adjacency eigenvalues of a connected graph with diameter d is at least d + 1 [2,7] that G must be a complete graph.”
- Eigenvalues and colorings of digraphs (2010, neutral): “Classification: 05C50, 05C20, 05C15, 15A48, 15A18”
- A connectivity-preserving flocking algorithm for multi-agent systems based only on position measurements (2009, background): “Denote the eigenvalues of (Godsil and Royle 2001).”
- Bisection algorithm of increasing algebraic connectivity by adding an edge (2009, background): “The algebraic connectivityλ2(G), originally defined in [4], has been identified as an important parameter in many systems problems defined over networks [5], [13], [14], [15], [16] (see [7] for a good introduction to the algebraic connectivity).”
- Forcing on Perfect Matchings - A Survey (2011, background): “For example, the dodecahedron is the fullerene C20 with 20 vertices, and the most important fullerene is buckminsterfullerene C60 obtained by leap-frog transformation of the fullerene C20, see [20].”
- Asynchronous consensus of continuous-time multi-agent systems with intermittent measurements (2010, background): “We first introduce some basic definitions in graph theory (Godsil and Royal 2001).”
- Delay robustness in consensus problems (2010, background): “As before, we introduce the following decomposition D− 1 2 (DT (−η)− Aτ (−η))D− 1 2 = D− 1 2 LD− 1 2 + D− 1 2 L̂(η)D− 1 2 , where L is the Laplacianmatrix of the underlying graph and L̂(η) = [l̂ji] satisfies l̂ji = aji(eτjiη−1) for i 6= j and l̂ii = ∑N j=1 aji(e Tjiη−1).”