From the Publisher:
A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols; more than 200 tables and figures; more than 1,000 numbered definitions, facts, examples, notes, and remarks; and over 1,250 significant references, including brief comments on each paper.

Handbook of Applied Cryptography

Graphs.- Groups.- Transitive Graphs.- Arc-Transitive Graphs.- Generalized Polygons and Moore Graphs.- Homomorphisms.- Kneser Graphs.- Matrix Theory.- Interlacing.- Strongly Regular Graphs.- Two-Graphs.- Line Graphs and Eigenvalues.- The Laplacian of a Graph.- Cuts and Flows.- The Rank Polynomial.- Knots.- Knots and Eulerian Cycles.- Glossary of Symbols.- Index.

/pdf/algebraic-graph-theory-2uyv2n44sf.pdf

Algebraic Graph Theory

(1977). Graph Theory with Applications. Journal of the Operational Research Society: Vol. 28, Volume 28, issue 1, pp. 237-238.

https://link.springer.com/content/pdf/10.1057%2Fjors.1977.45.pdf

Graph theory with applications

The use of randomness is now an accepted tool in Theoretical Computer Science but not everyone is aware of the underpinnings of this methodology in Combinatorics - particularly, in what is now called the probabilistic Method as developed primarily by Paul Erdoős over the past half century. Here I will explore a particular set of problems - all dealing with “good” colorings of an underlying set of points relative to a given family of sets. A central point will be the evolution of these problems from the purely existential proofs of Erdős to the algorithmic aspects of much interest to this audience.

/pdf/the-probabilistic-method-5g63k0itke.pdf

The Probabilistic Method

/pdf/the-evolution-of-random-graphs-437wjtlj5z.pdf

The evolution of random graphs

On the evolution of random graphs

2. Notation The letters a, b, c, d, x, y, z denote finite sets of non-negative integers, all other lower-case letters denote non-negative integers. If fc I, then [k, I) denotes the set {k,k+l,k+2,...,l-l} = {*: fc < « < Q. The obliteration operator " serves to remove from any system of elements the element above which it is placed. Thus [k,I) = {k,k-{-l,...,fy. The cardinal of o is \a\\ inclusion (in the wide sense), union, difference, and intersection of sets are denoted by o c b, a-\-b, a—b, ab respectively, and a—b = a—ab for all a, b. By 8(k,l,m) we denote the set of all systems (ao,av...,dn) such that avc[0,m); \av\ 1 (v < »),

Intersection theorems for systems of finite sets

Introduction. If the numbers of vertices and edges of a (linear) graph are suitably restricted, it is to be expected that something can be said about the configurations which the graph contains. As far as we know the first result in this direction is due to Turân. He proved that a graph with kn vertices and Ck,2n+1 edges always contains a complete graph of order k + 1. We shall here prove one such theorem (which arose originally out of a topological problem), and then list (without proofs) several other theorems and conjectures of this nature.

/pdf/on-the-structure-of-linear-graphs-4keqxegmzz.pdf

On the structure of linear graphs

The present note consists of some remarks on graphs. A graph G is a set of points some of which are connected by edges. We assume here that no two points are connected by more than one edge. The complementary graph G' of G has the same vertices as G and two points are connected in G' if and only if they are not connected in G. A special case of a theorem of Ramsey can be stated in graph theoretic language as follows: There exists a function f(k, I) of positive integers k, I with the following property. Let there be given a graph G of n*zf(kf I) vertices. Then either G contains a complete graph of order fe, or G' a complete graph of order L (A complete graph is a graph any two vertices of which are connected. The order of a complete graph is the number of its vertices.) I t would be desirable to have a formula for ƒ(£, I). This a t present we can not do. We have however the following estimates :

https://projecteuclid.org/download/pdf_1/euclid.bams/1183510596

Paul Erdös

Papers

On the evolution of random graphs

Intersection theorems for systems of finite sets

On the structure of linear graphs

Some remarks on the theory of graphs

A note on Hamiltonian circuits