QR-koda

Integral Laplacian graphs with a unique repeated Laplacian eigenvalue, I

The set Si,n={0,1,2,…,n−1,n}\{i}{S}_{i,n}=\left\{0,1,2,\ldots ,n-1,n\right\}\setminus \left\{i\right\}, 1⩽i⩽n1\leqslant i\leqslant n, is called Laplacian realizable if there exists an undirected simple graph whose Laplacian spectrum is Si,n{S}_{i,n}. The existence of such graphs was established by F...

Olles dieđut

Furkejuvvon:
Bibliográfalaš dieđut
Váldodahkkit: Hameed Abdul, Tyaglov Mikhail
Materiálatiipa: Artigo
Giella:Inglês
Almmustuhtton: De Gruyter 2023-12-01
Ráidu:Special Matrices
Fáttát:
Liŋkkat:https://doi.org/10.1515/spma-2023-0111
Fáddágilkorat: Lasit fáddágilkoriid
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!