Connectivity of some algebraically defined digraphs
From MaRDI portal
Publication:888582
zbMath1360.05077arXiv1807.11347MaRDI QIDQ888582
Felix Lazebnik, Aleksandr Kodess
Publication date: 2 November 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.11347
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20)
Related Items (4)
Classification by girth of three-dimensional algebraically defined monomial graphs over the real numbers ⋮ Connectivity of some algebraically defined digraphs ⋮ A Result on Polynomials Derived Via Graph Theory ⋮ On the girth of three-dimensional algebraically defined graphs with multiplicatively separable functions
Cites Work
- Unnamed Item
- Unnamed Item
- On the spectrum of Wenger graphs
- Monomial graphs and generalized quadrangles
- New lower bounds for Ramsey numbers of graphs and hypergraphs
- Connectivity of some algebraically defined digraphs
- On the diameter of Wenger graphs
- On hypergraphs of girth five
- On monomial graphs of girth eight
- General properties of some families of graphs defined by systems of equations
- Isomorphism criterion for monomial graphs
- An infinite series of regular edge- but not vertex-transitive graphs
- Orthomorphisms and the construction of projective planes
- Graphs from Generalized Kac--Moody Algebras
- Digraphs
This page was built for publication: Connectivity of some algebraically defined digraphs
