´╗┐

On determinants and permanents of minimally 1-factorable cubic bipartite graphs


Abstract


A minimally 1-factorable cubic bigraph is a graph in which every 1-factor lies in precisely one 1-factorization. The author investigates determinants and permanents of such graphs and, in particular, proves that the determinant of any minimally 1-factorable cubic bigraph of girth 4 is 0.

DOI Code: 10.1285/i15900932v20n1p37

Keywords: Determinant; Permanent; 1-factorization; Hamiltonian circuit; Bipartite

Classification: 05C70; 05C45; 05C50

Full Text: PDF


Creative Commons License
This work is licensed under a Creative Commons Attribuzione - Non commerciale - Non opere derivate 3.0 Italia License.