Graph Laplacian

Graph Laplacian is a matrix representation of a graph defined as the difference between the degree matrix and the adjacency matrix, serving as a discrete analogue of the Laplace operator that encodes structural properties of the network such as connectivity and diffusion dynamics.

2.4K

Publications

159.9K

Citations

4.1K

Authors

1.4K

Institutions

Publications per year

2017–2026

848

Variants

Laplacian Matrix

Authors

4.1K

  1. İG
    İvan Gutman

    University of Kragujevac, Serbia

    33 publications · 2.3K citations

    21

    h-index

  2. FN
    Feiping Nie

    Northwestern Polytechnical University, China

    22 publications · 4.1K citations

    21

    h-index

  3. KC
    Kinkar Chandra Das

    Sungkyunkwan University, South Korea

    37 publications · 1.1K citations

    20

    h-index

  4. BZ
    Bo Zhou

    South China Normal University, China

    24 publications · 1.4K citations

    20

    h-index

  5. GC
    Gene Cheung

    National Institute of Informatics, Japan

    22 publications · 1.1K citations

    17

    h-index

1–5 of 4.1K

Venues

  1. Linear Algebra and its Applications

    226 publications · 11.1K citations

    54

    h-index

  2. arXiv (Cornell University)

    Repository · 131 publications · 7.3K citations

    34

    h-index

  3. Linear and Multilinear Algebra

    72 publications · 3.1K citations

    29

    h-index

  4. IEEE Transactions on Automatic Control

    32 publications · 5.3K citations

    26

    h-index

  5. IEEE Transactions on Image Processing

    28 publications · 4.1K citations

    25

    h-index

1–5