## Abstract

A square (0, 1)-matrix X of order n ≥ 1 is called fully indecomposable if there exists no integer k with 1 ≤ k ≤ n - 1, such that X has a k by n - k zero submatrix. The reduced adjacency matrix of a bipartite graph G = (A, B, E) (having A∪B = {a _{1},..., a _{m}} ∪ {b _{1},..., b _{n}} as a vertex set, and E as an edge set), is X = [x _{ij}], 1 ≤ i ≤ m, 1 ≤ j ≤ n, where X _{ij} = 1 if a _{i}b _{j} ∈ E and x _{ij} = 0 otherwise. A stable set of a graph G is a subset of pairwise nonadjacent vertices. The stability number of G, denoted by α(G), is the cardinality of a maximum stable set in G. A graph is called α-stable if its stability number remains the same upon both the deletion and the addition of any edge. We show that a connected bipartite graph has exactly two maximum stable sets that partition its vertex set if and only if its reduced adjacency matrix is fully indecomposable. We also describe a decomposition structure of α-stable bipartite graphs in terms of their reduced adjacency matrices. On the base of these findings, we obtain both new proofs for a number of well-known theorems on the structure of matrices due to Brualdi (1966), Marcus and Mine (1963), Dulmage and Mendelsohn (1958), and some generalizations of these statements. Two kinds of matrix product are also considered (namely, Boolean product and Kronecker product), and their corresponding graph operations. As a consequence, we obtain a new proof of one Lewin's theorem claiming that the product of two fully indecomposable matrices is a fully indecomposable matrix.

Original language | English |
---|---|

Pages (from-to) | 1692-1706 |

Number of pages | 15 |

Journal | Journal of Universal Computer Science |

Volume | 13 |

Issue number | 11 |

State | Published - 2007 |

## Keywords

- Adjacency matrix
- Bistable bipartite graph
- Boolean product
- Cover irreducible matrix
- Elementary graph
- Fully indecomposable matrix
- Kronecker product
- Perfect matching
- Stable set
- Total support