1 citations · 2 across the 4 of their papers we have counts for
4 papers · 1 filter
A construction for a counterexample to the pseudo 2-factor isomorphic graph conjecture
M. Abreu, M. Funk, D. Labbate +1
A graph admiting a -factor is \textit{pseudo -factor isomorphic} if the parity of the number of cycles in all its -factors is the same. In [M. Abreu, A.A. Diwan, B. Ja…
Strongly regular configurations
Marién Abreu, Martin Funk, Vedran Krčadinac +1
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their…
On the Ubiquity and Utility of Cyclic Schemes
M. Abreu, M. J. Funk, D. Labbate +1
Let , and be positive integers. A --{\it scheme of valency} and {\it order} is a array of subsets $S_{ij} \subset…
Adjacency Matrices of Configuration Graphs
M. Abreu, M. Funk, D. Labbate +1
In 1960, Hoffman and Singleton \cite{HS60} solved a celebrated equation for square matrices of order , which can be written as where $I_n…