Weighted Graph Matrices

Weighted Graph Matrices is a formal mathematical construct that represents a weighted graph through a matrix in which each entry quantifies the weight of the edge between two vertices, distinguishing it from unweighted adjacency matrices by incorporating edge weights as numerical values rather than binary indicators.

103

Publications

6.2K

Citations

260

Authors

151

Institutions

Publications per year

2017–2026

27

Variants

Weighted Adjacency Matrices

Authors

260

  1. JB
    Joshua Batson

    Chan Zuckerberg Initiative (United States), United States

    3 publications · 439 citations

    3

    h-index

  2. NS
    Nikhil Srivastava

    Yale University, United States

    3 publications · 439 citations

    3

    h-index

  3. DA
    Daniel A. Spielman

    Yale University, United States

    3 publications · 439 citations

    3

    h-index

  4. SP
    Sukanta Pati

    Indian Institute of Technology Guwahati, India

    3 publications · 58 citations

    3

    h-index

  5. XW
    Xiaoqian Wang

    Jiangsu University, China

    2 publications · 39 citations

    2

    h-index

1–5 of 260

Venues

  1. Linear Algebra and its Applications

    9 publications · 221 citations

    9

    h-index

  2. Electronic Journal of Linear Algebra

    ELA · 4 publications · 91 citations

    4

    h-index

  3. Linear and Multilinear Algebra

    3 publications · 38 citations

    3

    h-index

  4. arXiv (Cornell University)

    Repository · 4 publications · 203 citations

    3

    h-index

  5. Discrete Mathematics

    3 publications · 145 citations

    3

    h-index

1–5