Meyniel extremal families of abelian Cayley graphs

DOI10.1007/s00373-022-02460-8zbMath1485.05115arXiv1909.03027OpenAlexW2971858457MaRDI QIDQ2117525

Fatemeh Hasiri, Igor Shinkar

Publication date: 21 March 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Cayley graphscops and robbersMeyniel extremal graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Games involving graphs (91A43) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Games on graphs (graph-theoretic aspects) (05C57)

Related Items

On the cop number of graphs of high girth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A game of cops and robbers
• A short note about pursuit games played on a graph with a given genus
• On a pursuit game on Cayley graphs
• Cops and robbers in graphs with large girth and Cayley graphs
• Vertex-to-vertex pursuit in a graph
• Meyniel's conjecture on the cop number: a survey
• Cops and robbers in a random graph
• Cops and robbers on directed and undirected abelian Cayley graphs
• A proof of the Meyniel conjecture for abelian Cayley graphs
• Norm-graphs and bipartite Turán numbers
• The Difference Between Consecutive Primes, II
• Cops and Robbers on Graphs Based on Designs
• Variations on cops and robbers
• On Meyniel's conjecture of the cop number
• Chasing robbers on random graphs: Zigzag theorem
• Pursuit-Evasion in Models of Complex Networks
• A Bound for the Cops and Robbers Problem
• Vertex Pursuit Games in Stochastic Network Models
• On a problem of K. Zarankiewicz