Complex Hadamard graphs and Butson matrices
AbstractThis article introduces complex Hadamard graphs and studies their properties. Using the complete subgraphs of these complex Hadamard graphs, complex Hadamard matrices of order n are generated, where n is a multiple of four. An algorithm to construct strongly regular graphs with n2 vertices u...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2023-05-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | https://www.tandfonline.com/doi/10.1080/09728600.2023.2237093 |
| _version_ | 1797691177624928256 |
|---|---|
| author | Briji Jacob Chathely Rajendra P. Deore |
| author_facet | Briji Jacob Chathely Rajendra P. Deore |
| author_sort | Briji Jacob Chathely |
| collection | DOAJ |
| description | AbstractThis article introduces complex Hadamard graphs and studies their properties. Using the complete subgraphs of these complex Hadamard graphs, complex Hadamard matrices of order n are generated, where n is a multiple of four. An algorithm to construct strongly regular graphs with n2 vertices using complex Hadamard matrices of order n is also discussed in this article. MAGMA codes to construct the adjacency matrices of these strongly regular graphs are also developed. |
| first_indexed | 2024-03-12T02:09:37Z |
| format | Article |
| id | doaj.art-d39df72883a74952b3bf696d8cd9206d |
| institution | Directory Open Access Journal |
| issn | 0972-8600 2543-3474 |
| language | English |
| last_indexed | 2024-03-12T02:09:37Z |
| publishDate | 2023-05-01 |
| publisher | Taylor & Francis Group |
| record_format | Article |
| series | AKCE International Journal of Graphs and Combinatorics |
| spelling | doaj.art-d39df72883a74952b3bf696d8cd9206d2023-09-06T14:45:48ZengTaylor & Francis GroupAKCE International Journal of Graphs and Combinatorics0972-86002543-34742023-05-0120219319910.1080/09728600.2023.2237093Complex Hadamard graphs and Butson matricesBriji Jacob Chathely0Rajendra P. Deore1Department of Mathematics, University of Mumbai, Mumbai, IndiaDepartment of Mathematics, University of Mumbai, Mumbai, IndiaAbstractThis article introduces complex Hadamard graphs and studies their properties. Using the complete subgraphs of these complex Hadamard graphs, complex Hadamard matrices of order n are generated, where n is a multiple of four. An algorithm to construct strongly regular graphs with n2 vertices using complex Hadamard matrices of order n is also discussed in this article. MAGMA codes to construct the adjacency matrices of these strongly regular graphs are also developed.https://www.tandfonline.com/doi/10.1080/09728600.2023.2237093Hadamard matricesstrongly regular graphsButson matricescliquemaximal complete subgraphs15B34 |
| spellingShingle | Briji Jacob Chathely Rajendra P. Deore Complex Hadamard graphs and Butson matrices AKCE International Journal of Graphs and Combinatorics Hadamard matrices strongly regular graphs Butson matrices clique maximal complete subgraphs 15B34 |
| title | Complex Hadamard graphs and Butson matrices |
| title_full | Complex Hadamard graphs and Butson matrices |
| title_fullStr | Complex Hadamard graphs and Butson matrices |
| title_full_unstemmed | Complex Hadamard graphs and Butson matrices |
| title_short | Complex Hadamard graphs and Butson matrices |
| title_sort | complex hadamard graphs and butson matrices |
| topic | Hadamard matrices strongly regular graphs Butson matrices clique maximal complete subgraphs 15B34 |
| url | https://www.tandfonline.com/doi/10.1080/09728600.2023.2237093 |
| work_keys_str_mv | AT brijijacobchathely complexhadamardgraphsandbutsonmatrices AT rajendrapdeore complexhadamardgraphsandbutsonmatrices |