A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth.

Published in: J. Comb. Theory, Ser. A (2010)

Keyphrases

graph theory
graph matching
transitive closure
structured objects
structured data
graph structure
graph theoretic
construction process
computational complexity
pairwise
expressive power
graph model
graph databases
fixed number
graph representation
graph data