On the homogeneous algebraic graphs of large girth and their applications
From MaRDI portal
Publication:1006033
DOI10.1016/j.laa.2008.08.023zbMath1156.05028OpenAlexW2063989392MaRDI QIDQ1006033
Tanush Shaska, Vasiliy A. Ustimenko
Publication date: 17 March 2009
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2008.08.023
Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Quantum computation (81P68) Cryptography (94A60) Computational aspects of higher-dimensional varieties (14Q15) Quadratic and bilinear forms, inner products (15A63) Extremal combinatorics (05D99) Theory of computing (68Q99)
Related Items
On the conjecture for the girth of the bipartite graph \(D(k,q)\), On the girth of the bipartite graph \(D(k, q)\), Girth of the algebraic bipartite graph \(D(k,q)\), On the girth cycles of the bipartite graph \(D(k, q)\), On the comparison of cryptographical properties of two different families of graphs with large cycle indicator, The implementation of cubic public keys based on a new family of algebraic graphs, On the key exchange with new cubical maps based on graphs, On Dynamical Systems of Large Girth or Cycle Indicator and Their Applications to Multivariate Cryptography
Uses Software
Cites Work
- Sur la trialité et certains groupes qui s'en déduisent
- Explicit construction of regular graphs without small cycles
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Note on the girth of Ramanujan graphs
- On a class of degenerate extremal graph problems
- The sextet construction for cubic graphs
- Girths of bipartite sextet graphs
- New upper bounds on the order of cages
- Compactness results in extremal graph theory
- Cycles of even length in graphs
- Graphs with special arcs and cryptography
- Extremal properties of regular and affine generalized \(m\)-gons as tactical configurations
- Graphs of prescribed girth and bi-degree
- A characterization of the components of the graphs \(D(k,q)\)
- The nonexistence of certain generalized polygons
- Dense quantum coding and quantum finite automata
- A transform theory for a class of group-invariant codes
- A recursive approach to low complexity codes
- A new series of dense graphs of high girth
- Constructions of Polygons From Buildings
- Quantum Cryptography and Secret-Key Distillation
- Regular Graphs with Given Girth and Restricted Circuits
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
