The strongly regular (45, 12, 3, 3) graphs.
Coolsaet, Kris, Degraer, Jan, Spence, Edward (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Coolsaet, Kris, Degraer, Jan, Spence, Edward (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Spence, E. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gera, Ralucca, Shen, Jian (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bonato, Anthony, Holzmann, W.H., Kharaghani, Hadi (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bojan Mohar, Svatopluk Poljak (1990)
Czechoslovak Mathematical Journal
Similarity:
H. S. Ramane, D. S. Revankar, I. Gutman, H. B. Walikar (2009)
Publications de l'Institut Mathématique
Similarity:
Cvetković, Dragoš, Simić, Slobodan (1993)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Ravindra B. Bapat, Masoud Karimi (2017)
Discussiones Mathematicae Graph Theory
Similarity:
Graphs G and H are called cospectral if they have the same characteristic polynomial. If eigenvalues are integral, then corresponding graphs are called integral graph. In this article we introduce a construction to produce pairs of cospectral integral regular graphs. Generalizing the construction of G4(a, b) and G5(a, b) due to Wang and Sun, we define graphs 𝒢4(G,H) and 𝒢5(G,H) and show that they are cospectral integral regular when G is an integral q-regular graph of order m and H...
Fiol, M.A. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Abdollahi, A., Vatandoost, E. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
D. Cvetković (2005)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity: