Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

Voted

EJC
2007

favoriteEmaildiscussreport

115views Information Technology» more EJC 2007»

A new family of locally 5-arc transitive graphs

13 years 4 months ago

A new family of locally 5-arc transitive graphs

Download school.maths.uwa.edu.au

We present a new family of locally 5–arc transitive graphs. The graphs constructed are bipartite with valency {2m + 1, 2m}. The actions of the automorphism group on the two bipartite halves are distinctly diﬀerent and the corresponding amalgams are new. Key words: locally s–arc transitive graphs

Michael Giudici, Cai Heng Li, Cheryl E. Praeger

Real-time Traffic

Automorphism Group | Bipartite Halves | EJC 2007 | Information Technology | Transitive Graphs |

claim paper

Related Content

» Quantum and Randomized Lower Bounds for Local Search on VertexTransitive Graphs

» Bidimensional Parameters and Local Treewidth

» New Tools for Graph Coloring

» Identifying useful subgoals in reinforcement learning by local graph partitioning

» Modal and transition dwell time computation in switching systems a settheoretic approach

» Short Transitive Signatures for Directed Trees

» New Classes of Counterexamples to Hendricksons Global Rigidity Conjecture

» Local Graph Partitions for Approximation and Testing

» Lower Bounds for Local Monotonicity Reconstruction from TransitiveClosure Spanners

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	EJC
Authors	Michael Giudici, Cai Heng Li, Cheryl E. Praeger

Comments (0)