Generation of strongly regular graphs from quaternary complex Hadamard matrices
A strongly regular graph with parameters (<em>v</em><em>,</em> <em>k, </em>μ, λ)<em> </em>is a regular graph <em>G </em>with <em>v </em>vertices and <em>k </em>degree in which every two adjacent vertices have λ commo...
Main Authors: | W. V. Nishadi, K. D. E. Dhananjaya, A. A. I. Perera, P. Gunathilake |
---|---|
Format: | Article |
Language: | English |
Published: |
Faculty of Science, University of Peradeniya, Sri Lanka
2018-03-01
|
Series: | Ceylon Journal of Science |
Subjects: | |
Online Access: | https://cjs.sljol.info/articles/7488 |
Similar Items
-
4-REGULAR GRAPH OF DIAMETER 2
by: Đỗ Như An, et al.
Published: (2013-06-01) -
AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {39; 36; 4; 1; 1; 36}
by: Konstantin S. Efimov, et al.
Published: (2018-12-01) -
On Some Regular Two-Graphs up to 50 Vertices
by: Marija Maksimović
Published: (2023-02-01) -
ON DISTANCE–REGULAR GRAPHS OF DIAMETER 3 WITH EIGENVALUE \(\theta=1\)
by: Alexander A. Makhnev, et al.
Published: (2022-12-01) -
Applications of Strongly Regular Cayley Graphs to Codebooks
by: Qiuyan Wang, et al.
Published: (2023-01-01)