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

Authors

  • D. Labbate

DOI:

https://doi.org/10.1285/i15900932v20n1p37

Keywords:

Determinant, Permanent, 1-factorization, Hamiltonian circuit, Bipartite

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.

Downloads

Published

01-10-2001

Issue

Volume 20, Issue 1 (2000-2001)

Section

Articoli

License

Authors who publish with this publication accept all the terms and conditions of the Creative Commons license at the link below.

Gli autori che pubblicano in questa rivista accettano i termini e le condizioni specificate nella licenza Creative Commons di cui al link sottostante.

http://creativecommons.org/licenses/by-nc-nd/3.0/it/legalcode