A prolific construction of strongly regular graphs with the -e. c. property.
Cameron, Peter J., Stark, Dudley (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “New prolific constructions of strongly regular graphs.”
A prolific construction of strongly regular graphs with the -e. c. property.
Embedding arbitrary graphs into strongly regular and distance-regular graphs.
Fon-Der-Flaass, D.G. (2005)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Similarity:
Extension of strongly regular graphs.
Gera, Ralucca, Shen, Jian (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The strongly regular (40, 12, 2, 4) graphs.
Spence, E. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On infinite outerplanar graphs
Luis B. Boza, Ana Diánez, Alberto Márquez (1994)
Mathematica Bohemica
Similarity:
In this Note, we study infinite graphs with locally finite outerplane embeddings, given a characterization by forbidden subgraphs.
Magic and supermagic dense bipartite graphs
Jaroslav Ivanco (2007)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (and consecutive) positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In the paper we prove that any balanced bipartite graph with minimum degree greater than |V(G)|/4 ≥ 2 is magic. A similar result is presented for supermagic regular bipartite graphs.
DISTANCE SPECTRA AND DISTANCE ENERGIES OF ITERATED LINE GRAPHS OF REGULAR GRAPHS
H. S. Ramane, D. S. Revankar, I. Gutman, H. B. Walikar (2009)
Publications de l'Institut Mathématique
Similarity:
The strongly regular (45, 12, 3, 3) graphs.
Coolsaet, Kris, Degraer, Jan, Spence, Edward (2006)
The Electronic Journal of Combinatorics [electronic only]
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...