WEAKLY HADAMARD DIAGONALIZABLE GRAPHS

ADM, MOHAMMAD; ALMUHTASEB, KHAWLA; FALLAT, SHAUN; MEAGHER, KAREN; NASSERASR, SHAHLA; N. SHIRAZI, MAHSA; S. RAZAFIMAHATRATRA, A

dc.contributor.author	ADM, MOHAMMAD
dc.contributor.author	ALMUHTASEB, KHAWLA
dc.contributor.author	FALLAT, SHAUN
dc.contributor.author	MEAGHER, KAREN
dc.contributor.author	NASSERASR, SHAHLA
dc.contributor.author	N. SHIRAZI, MAHSA
dc.contributor.author	S. RAZAFIMAHATRATRA, A
dc.date.accessioned	2022-01-18T11:12:20Z
dc.date.accessioned	2022-05-22T08:55:53Z
dc.date.available	2022-01-18T11:12:20Z
dc.date.available	2022-05-22T08:55:53Z
dc.date.issued	2020-03-03
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/8411
dc.description.abstract	A matrix is called weakly Hadamard if its entries are from {0, −1, 1} and its non-consecutive columns (with some ordering) are orthogo nal. Unlike Hadamard matrices, there is a weakly Hadamard matrix of order n for every n ≥ 1. In this work, graphs for which their Laplacian matrices can be diagonalized by a weakly Hadamard matrix are studied. A number of necessary and su cient conditions are veri ed along with identi cation of numerous families of graphs whose Laplacian matrices can be diagonalized by a weakly Hadamard matrix.	en_US
dc.language.iso	en	en_US
dc.publisher	2010 Mathematics Subject Classi cation. 05C50, 15A18 .	en_US
dc.subject	Hadamard matrices; Laplacians, eigenspaces, strongly-regular graphs	en_US
dc.title	WEAKLY HADAMARD DIAGONALIZABLE GRAPHS	en_US
dc.type	Article	en_US