VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Weakly Hadamard diagonalizable graphs
    Adm, Mohammad ...
    A matrix is called weakly Hadamard if its entries are from {0, −1, 1} and its non-consecutive columns (with some ordering) are orthogonal. 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 sufficient conditions are verified along with identification of numerous families of graphs whose Laplacian matrices can be diagonalized by a weakly Hadamard matrix.
    Vir: Linear algebra and its applications. - ISSN 0024-3795 (Vol. 610, 2021, str. 86-119)
    Vrsta gradiva - članek, sestavni del ; neleposlovje za odrasle
    Leto - 2021
    Jezik - angleški
    COBISS.SI-ID - 123064835

    Povezava(-e):

    https://www.sciencedirect.com/science/article/pii/S0024379520304663?via%3Dihub#!
    https://doi.org/10.1016/j.laa.2020.09.038
    DOI

Vnos na polico