Directed Graph Matrices
Directed Graph Matrices is a mathematical construct that represents a directed graph as an adjacency matrix, wherein the entry in the i-th row and j-th column indicates the presence or weight of a directed edge from vertex i to vertex j, distinguishing it from undirected graph matrices by encoding asymmetric relationships.
130
Publications
6.1K
Citations
263
Authors
146
Institutions
Publications per year
2017–2026
27
130
Laplacians and the Cheeger Inequality for Directed Graphs
Fan Chung · Annals of Combinatorics · 2005 · 562 citations
1–5 of 130
263
3
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 263
146
Dalian University of Technology
Dalian, China
6 h-index
18 publications
762 citations

Harbin Institute of Technology
Harbin, China
5 h-index
10 publications
1.7K citations
University of Wisconsin–Madison
Madison, United States
5 h-index
6 publications
273 citations
University of Illinois Urbana-Champaign
Urbana, United States
4 h-index
4 publications
426 citations
Yale University
New Haven, United States
4 h-index
6 publications
460 citations

University of Regina
Regina, Canada
3 h-index
3 publications
78 citations
University of California, Riverside
Riverside, United States
3 h-index
3 publications
838 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
3 h-index
3 publications
174 citations
1–8 of 146
9 publications · 359 citations
9
h-index
3 publications · 134 citations
4
h-index
Repository · 4 publications · 62 citations
4
h-index
3 publications · 848 citations
3
h-index
3 publications · 162 citations
3
h-index
1–5