A construction of imprimitive symmetric graphs which are not multicovers of their quotients

DOI10.1016/j.disc.2011.08.006zbMath1242.05120arXiv0905.2516OpenAlexW1997214465MaRDI QIDQ409392

Bin Jia

Publication date: 13 April 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0905.2516

zbMATH Keywords

symmetric graphquotient graph\(s\)-arc-transitive graphdouble-star graphimprimitive graphmulticover

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Hadwiger's Conjecture for ℓ‐Link Graphs

Cites Work

• Unnamed Item
• Finite symmetric graphs with two-arc transitive quotients
• On finite \(s\)-transitive graphs of odd order
• Constructing a class of symmetric graphs
• On primitive permutation groups with small suborbits and their orbital graphs.
• On a class of finite symmetric graphs
• A local analysis of imprimitive symmetric graphs
• Almost covers of 2-arc transitive graphs
• A class of symmetric graphs with 2-arc transitive quotients
• CROSS RATIO GRAPHS
• Topological covers of complete graphs
• A class of finite symmetric graphs with 2-arc transitive quotients
• Finite symmetric graphs with two‐arc transitive quotients II
• A new 5‐arc‐transitive cubic graph

This page was built for publication: A construction of imprimitive symmetric graphs which are not multicovers of their quotients