All Questions

Let $G$ be a finite directed acyclic graph. The Cartan matrix $C_G=C$ of $G$ is defined as the matrix with rows and colums indexed by the vertices of $G$ and $c_{i,j}$ counts the number of paths from $...

Questions. (numerical.generalPfaffian) Is it proved anywhere that in general it is not easier0 to calculate the determinant (over $\mathbb{Q}$) of the skew-symmetric signed adjacency matrix defined ...

There are many algebraic structures linked to graphs. For example one can find zero divisor graphs $[1]$, $[2]$ and many other graphs. Does there exist any survey paper which characterizes all the ...