Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4652164 | Electronic Notes in Discrete Mathematics | 2013 | 14 Pages |
Abstract
Explicit constructions in Extremal graph theory give appropriate lower bound for Turan type problems. In the case of prohibited cycles explicit constructions can be used in various problems of Information Security. We observe algebraic constructions of regular graphs of large girth and graphs with large cycle indicator and describe some algorithms of Coding Theory and Cryptography based on such special families of graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics