Permanent, determinant, and rank of bi-block graphs
Sign Up to like & getrecommendations! Published in 2019 at "Aequationes mathematicae"
DOI: 10.1007/s00010-019-00687-0
Abstract: Computing the permanent of a (0, 1)-square matrix is a $$\# P$$ # P -complete problem, whereas the determinant and rank are solved in polynomial time. A simple graph is called a bi-block graph if each… read more here.
Keywords: rank block; permanent determinant; block; determinant rank ... See more keywords