Bipartite Graph Matrices

Bipartite Graph Matrices is a matrix representation method that encodes the structure of a bipartite graph by organizing its adjacency relationships into a rectangular matrix form where rows and columns correspond to the two disjoint vertex sets and nonzero entries indicate edges between them.

200

Publications

7.4K

Citations

421

Authors

251

Institutions

Publications per year

2017–2026

34

Variants

Bipartite Adjacency Matrices

Authors

421

  1. DO
    D.D. Olesky

    University of Victoria, Canada

    4 publications · 64 citations

    4

    h-index

  2. PV
    P. van den Driessche

    University of Victoria, Canada

    4 publications · 64 citations

    4

    h-index

  3. HZ
    Heping Zhang

    Lanzhou University, China

    3 publications · 53 citations

    3

    h-index

  4. İG
    İvan Gutman

    University of Kragujevac, Serbia

    3 publications · 67 citations

    3

    h-index

  5. AS
    Alexander Sidorenko

    Courant Institute of Mathematical Sciences, United States

    3 publications · 243 citations

    3

    h-index

1–5 of 421

Venues

  1. Discrete Mathematics

    28 publications · 688 citations

    16

    h-index

  2. Linear Algebra and its Applications

    15 publications · 580 citations

    12

    h-index

  3. Discrete Applied Mathematics

    7 publications · 195 citations

    7

    h-index

  4. Graphs and Combinatorics

    6 publications · 383 citations

    6

    h-index

  5. Journal of Combinatorial Theory Series B

    6 publications · 161 citations

    6

    h-index

1–5