(0, 1)-Matrices with Isomorphic Term Bigraphs have Equal Ranks


Abstract

Let M = || mij || be a (0, l)-matrix of order m x n. The term bigraph T(M) of M is the graph whose vertex set is the union of two disjoint sets V = {V1,..., Vm) and W = {w1,..., wn} and in which the vertices vi, wj (1 ≤ i ≤ m, 1 ≤ j ≤ n) are adjacent if and only if mij = 1, while neither any two vertices of V, nor any two vertices of W are joined together by an edge.

Subject Discipline

Mathematical Sciences

Full Text:

References

B. DEVADAS ACHARYA, Research Problem. Graph Theory Newsletter Vol. 3, No. 5, May 1974.


Refbacks

  • There are currently no refbacks.