Graphs with special arcs and cryptography
The author studies a graph theory model for encryption of messages. The vertices of a graph represent possible messages and encryption steps to edges in the graph. Special graphs of high girth naturally arise in the area. The author presents a construction of some such graphs and discusses their properties. Applications in practice are also briefly sketched in the paper.
scientific article; zbMATH DE number 1879599