New prolific constructions of strongly regular graphs.
Fon-Der-Flaass, Dmitry G. (2002)
Advances in Geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A prolific construction of strongly regular graphs with the -e. c. property.”
New prolific constructions of strongly regular graphs.
Embedding arbitrary graphs into strongly regular and distance-regular graphs.
Fon-Der-Flaass, D.G. (2005)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Similarity:
The strongly regular (40, 12, 2, 4) graphs.
Spence, E. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Extension of strongly regular graphs.
Gera, Ralucca, Shen, Jian (2008)
The Electronic Journal of Combinatorics [electronic only]
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 independent vertices and edges of belt graphs.
Gutman, I. (1996)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property.
Bonato, Anthony, Holzmann, W.H., Kharaghani, Hadi (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bounded-degree graphs have arbitrarily large geometric thickness.
Barát, János, Matoušek, Jirí, Wood, David R. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graphs having planar complementary line (total) graphs.
Simic, Slobodan K. (1981)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Multiprocessor Interconnection Networks
Dragoš Cvetković, Tatjana Davidović (2011)
Zbornik Radova
Similarity:
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:
Clique-width and the speed of hereditary properties.
Allen, Peter, Lozin, Vadim, Rao, Michaël (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A Reduction of the Graph Reconstruction Conjecture
S. Monikandan, J. Balakumar (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is said to be reconstructible if it is determined up to isomor- phism from the collection of all its one-vertex deleted unlabeled subgraphs. Reconstruction Conjecture (RC) asserts that all graphs on at least three vertices are reconstructible. In this paper, we prove that interval-regular graphs and some new classes of graphs are reconstructible and show that RC is true if and only if all non-geodetic and non-interval-regular blocks G with diam(G) = 2 or diam(Ḡ) = diam(G) = 3...