Weighted Adjacency

Weighted Adjacency is a graph-theoretic construct in adjacency analysis that characterizes pairwise relationships between nodes by assigning numerical weights to edges, thereby quantifying the strength, intensity, or capacity of connections in contrast to unweighted adjacency which merely indicates presence or absence of a link.

63

Publications

3.1K

Citations

199

Authors

128

Institutions

Publications per year

2017–2026

33

Authors

199

  1. PL
    Po‐Ling Loh

    University of Wisconsin–Madison, United States

    3 publications · 104 citations

    3

    h-index

  2. VJ
    Varun Jog

    University of Wisconsin–Madison, United States

    3 publications · 104 citations

    3

    h-index

  3. EK
    Egemen K. Çetinkaya

    University of Kansas, United States

    2 publications · 30 citations

    2

    h-index

  4. GC
    Graziano Chesi

    University of Hong Kong, Hong Kong SAR China

    2 publications · 62 citations

    2

    h-index

  5. SA
    Santosh Ajith Gogi

    University of Kansas, United States

    2 publications · 30 citations

    2

    h-index

1–5 of 199

Venues

  1. IEEE Transactions on Cybernetics

    2 publications · 93 citations

    2

    h-index

  2. The Annals of Statistics

    1 publications · 54 citations

    1

    h-index

  3. Journal of Computing in Civil Engineering

    1 publications · 22 citations

    1

    h-index

  4. BMC Systems Biology

    1 publications · 18 citations

    1

    h-index

  5. IEEE Sensors Letters

    1 publications · 14 citations

    1

    h-index

1–5