On new results on extremal graph theory, theory of algebraic graphs, and their applications

DOI10.15407/DOPOVIDI2022.04.025OpenAlexW4294755661MaRDI QIDQ5041496

V. A. Ustimenko

Publication date: 14 October 2022

Published in: Reports of the National Academy of Sciences of Ukraine (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15407/dopovidi2022.04.025

zbMATH Keywords

LDPC codescryptographic algorithmssmall world graphsfamily of graphs of large girth

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Structural characterization of families of graphs (05C75) Combinatorial codes (94B25)

Related Items (1)

The constructions and the judgement algorithms about G-extremal graphs and G-near-extremal graphs

This page was built for publication: On new results on extremal graph theory, theory of algebraic graphs, and their applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041496)