Dynamic cage survey.
Exoo, Geoffrey, Jajcay, Robert (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “The triangular extensions of a generalized quadrangle of order .”
Dynamic cage survey.
Neighbourhoods in line graphs
Ľubomír Šoltés (1992)
Mathematica Slovaca
Similarity:
Characterizations of the Family of All Generalized Line Graphs-Finite and Infinite-and Classification of the Family of All Graphs Whose Least Eigenvalues ≥ −2
Gurusamy Rengasamy Vijayakumar (2013)
Discussiones Mathematicae Graph Theory
Similarity:
The infimum of the least eigenvalues of all finite induced subgraphs of an infinite graph is defined to be its least eigenvalue. In [P.J. Cameron, J.M. Goethals, J.J. Seidel and E.E. Shult, Line graphs, root systems, and elliptic geometry, J. Algebra 43 (1976) 305-327], the class of all finite graphs whose least eigenvalues ≥ −2 has been classified: (1) If a (finite) graph is connected and its least eigenvalue is at least −2, then either it is a generalized line graph or it is represented...
On the graphs of Hoffman-Singleton and Higman-Sims.
Hafner, Paul R. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Embedding arbitrary graphs into strongly regular and distance-regular graphs.
Fon-Der-Flaass, D.G. (2005)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Similarity:
A note on the graph equation .
Simić, Slobodan K. (1988)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Problems in algebraic combinatorics.
Godsil, C.D. (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Extended near hexagons and line systems.
Cuypers, Hans (2004)
Advances in Geometry
Similarity:
On Graph-Based Cryptography and Symbolic Computations
V. A., Ustimenko (2007)
Serdica Journal of Computing
Similarity:
We have been investigating the cryptographical properties of in nite families of simple graphs of large girth with the special colouring of vertices during the last 10 years. Such families can be used for the development of cryptographical algorithms (on symmetric or public key modes) and turbocodes in error correction theory. Only few families of simple graphs of large unbounded girth and arbitrarily large degree are known. The paper is devoted to the more general theory of directed...