All Questions

To get some feel for the size of a particular computation, I would like to know the approximate number of (pairwise-nonisomorphic) cubic bipartite graphs on $40$ vertices whose bipartite adjacency ...

Let $\Gamma = (P,L,I)$ be a point-line geometry (here, $P$ is the point set, $L$ the line set, and $I$ is the symmetric incidence relation). (As an example, $\Gamma$ could be a graph.) I suppose $\...

Given two positive integers $n$ and $a \leq \frac{n}{2}$ consider a $n \times n$ matrix $A$ such that, all the diagonal entries are either $a$ or $a+1$ all the non-zero off-diagonal entries are $\pm ...

We have a simple graph with vertices $\{v_1, v_2, ... v_n\}$. The adjacency matrix of this graph is $A= (a_{ij})$ so that $a_{ij}=1$ if $i+j$ belongs to the Fibonacci sequence; $a_{ij}=0$ ...