![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
(0, 1)-Matrices with Isomorphic Term Bigraphs have Equal Ranks
Subscribe/Renew Journal
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.
Subscription
Login to verify subscription
User
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 379
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 0