Bounding the size of a vertex-stabiliser in a finite vertex-transitive graph.
Cheryl E. PraegerPablo SpigaGabriel VerretPublished in: J. Comb. Theory, Ser. B (2012)
Keyphrases
- directed graph
- undirected graph
- minimum weight
- hamiltonian cycle
- labeled graphs
- attributed graphs
- edge weights
- vertex set
- average degree
- random walk
- bipartite graph
- spanning tree
- maximum cardinality
- graph theoretic
- graph matching
- graph structure
- strongly connected
- graph theory
- phase transition
- upper bound
- computational complexity
- similarity measure