Adjacency Matrix is a discrete mathematical structure in graph theory that represents a finite graph by mapping its vertices into a square matrix where each entry indicates the presence (and possibly weight or multiplicity) of an edge between vertex pairs, thereby encoding the connectivity of a network in algebraic form.
928
Publications
50.7K
Citations
1.9K
Authors
894
Institutions
Publications per year
2017–2026
310
Variants
Adjacency Matrix
Publications
928
Laplacian matrices of graphs: a survey
Russell Merris · Linear Algebra and its Applications · 1994 · 1.5K citations
Mathematical Formulation of Multilayer Networks
Physical Review X · 2013 · 915 citations · Full text
1–5 of 928
Authors
1.9K
- SM
9
h-index
- WH
8
h-index
- MR
8
h-index
- SL
7
h-index
- IS
7
h-index
1–5 of 1.9K
Institutions
894
Centre National de la Recherche Scientifique
Paris, France
12 h-index
18 publications
1.3K citations
Chinese Academy of Sciences
Beijing, China
11 h-index
24 publications
1.4K citations
Central China Normal University
Wuhan, China
11 h-index
20 publications
642 citations
University of Michigan
Ann Arbor, United States
10 h-index
13 publications
1.1K citations
Carnegie Mellon University
Pittsburgh, United States
10 h-index
21 publications
1.3K citations
Tilburg University
Tilburg, The Netherlands
10 h-index
14 publications
318 citations
University of Waterloo
Waterloo, Canada
9 h-index
14 publications
420 citations
University of California San Diego
San Diego, United States
8 h-index
8 publications
394 citations
1–8 of 894
Venues
- Linear Algebra and its Applications
44 publications · 3.2K citations
24
h-index
- arXiv (Cornell University)
Repository · 39 publications · 1.9K citations
22
h-index
- Linear and Multilinear Algebra
29 publications · 1.3K citations
18
h-index
- Discrete Mathematics
24 publications · 658 citations
16
h-index
- The Electronic Journal of Combinatorics
18 publications · 619 citations
13
h-index
1–5