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

Authors

263

  1. AS
    A. Stephen Morse

    Yale University, United States

    3 publications · 361 citations

    3

    h-index

  2. DW
    Dong Wang

    Dalian University of Technology, China

    2 publications · 120 citations

    3

    h-index

  3. SM
    Shaoshuai Mou

    Purdue University West Lafayette, United States

    3 publications · 361 citations

    3

    h-index

  4. JM
    Jie Mei

    Harbin Institute of Technology, China

    3 publications · 838 citations

    3

    h-index

  5. RA
    Richard A. Brualdi

    University of Wisconsin–Madison, United States

    3 publications · 166 citations

    3

    h-index

1–5 of 263

Venues

  1. Linear Algebra and its Applications

    9 publications · 359 citations

    9

    h-index

  2. Information Sciences

    3 publications · 134 citations

    4

    h-index

  3. arXiv (Cornell University)

    Repository · 4 publications · 62 citations

    4

    h-index

  4. Automatica

    3 publications · 848 citations

    3

    h-index

  5. Linear and Multilinear Algebra

    3 publications · 162 citations

    3

    h-index

1–5