# Algebraic Graph Theory

```@inproceedings{Godsil2001AlgebraicGT,
title={Algebraic Graph Theory},
author={Chris D. Godsil and Gordon F. Royle},
year={2001}
}```
• Published in Graduate texts in mathematics 20 April 2001
• Mathematics
Graphs.- Groups.- Transitive Graphs.- Arc-Transitive Graphs.- Generalized Polygons and Moore Graphs.- Homomorphisms.- Kneser Graphs.- Matrix Theory.- Interlacing.- Strongly Regular Graphs.- Two-Graphs.- Line Graphs and Eigenvalues.- The Laplacian of a Graph.- Cuts and Flows.- The Rank Polynomial.- Knots.- Knots and Eulerian Cycles.- Glossary of Symbols.- Index.
8,883 Citations
An algebraic approach to graph theory can be useful in numerous ways. There is a relatively natural intersection between the fields of algebra and graph theory, specifically between group theory and
• Mathematics
Ars Math. Contemp.
• 2009
It is shown that the irreducible graphs in this family have quasiprimitive automorphism groups, and it is proved (using the Classification of Finite Simple Groups) that no graph in thisfamily has a holomorphic simple automorphisms group.
• Mathematics
• 2014
A Cayley graph of a group is called normal edge-transitive if the normalizer of the right representation of the group in the automorphism of the Cayley graph acts transitively on the set of edges of
• M. Orel
• Mathematics
Electron. J. Comb.
• 2015
Two related infinite families of graphs are considered, which generalize the Petersen and the Coxeter graph, and it is determined which of these graphs are vertex/edge/arc-transitive or distance-regular.
Coset graphs are a generalization of Cayley graphs. They arise in the construction of graphs and digraphs with transitive automorphism groups. Moreover, the consideration of coset graphs makes it
• Mathematics
• 2022
A graph is vertex-transitive if its automorphism group acts transitively on vertices of the graph. A vertex-transitive graph is a Cayley graph if its automorphism group contains a subgroup acting
• Mathematics
Des. Codes Cryptogr.
• 2017
The possible connection sets for the lattice graphs are classified and some results on the structure of distance-regular Cayley line graphs of incidence graphs of generalized polygons are obtained.

## References

SHOWING 1-7 OF 7 REFERENCES

The bound (t+1)(k-t-1) represents the best possible strengthening of the original 1961 theorem of Erdös, Ko, and Rado which reaches the same conclusion under the hypothesisn≧t+(k−t) .
• Mathematics
• 1961
2. Notation The letters a, b, c, d, x, y, z denote finite sets of non-negative integers, all other lower-case letters denote non-negative integers. If fc I, then [k, I) denotes the set

### An Erdos-Ko-Rado theorem for the derangement graph of PGL(2,q) acting on the projective line

• An Erdos-Ko-Rado theorem for the derangement graph of PGL(2,q) acting on the projective line

• 2001