Searcharxiv⌕ Search

arXiv subjects

M. Abreu

Publications and source records attributed to M. Abreu.

28 records · Page 2Linked to original sources

Odd 2-factored snarks

A {\em snark} is a cubic cyclically 4-edge connected graph with edge chromatic number four and girth at least five. We say that a graph $G$ is {\em odd 2-factored} if for each 2-factor F of G each cycle of F is odd. In this paper, we present a method for constructing odd 2--factored snarks. In particular, we construct two families of odd 2-factored snarks that disprove a conjecture by some of the authors. Moreover, we approach the problem of characterizing odd 2-factored snarks furnishing a partial characterization of cyclically 4-edge connected odd 2-factored snarks. Finally, we pose a new conjecture regarding odd 2-factored snarks.

math.CO↗

Families of small regular graphs of girth 7

The first known families of cages arised from the incidence graphs of generalized polygons of order $q$, $q$ a prime power. In particular, $(q+1,6)$--cages have been obtained from the projective planes of order $q$. Morever, infinite families of small regular graphs of girth 5 have been constructed performing algebraic operations on $\mathbb{F}_q$. In this paper, we introduce some combinatorial operations to construct new infinite families of small regular graphs of girth 7 from the $(q+1,8)$--cages arising from the generalized quadrangles of order $q$, $q$ a prime power.

math.CO↗

Biregular cages of girth five

Let $2 \le r < m$ and $g$ be positive integers. An $({r,m};g)$--graph} (or biregular graph) is a graph with degree set ${r,m}$ and girth $g$, and an $({r,m};g)$-cage (or biregular cage) is an $({r,m};g)$-graph of minimum order $n({r,m};g)$. If $m=r+1$, an $({r,m};g)$-cage is said to be a semiregular cage. In this paper we generalize the reduction and graph amalgam operations from M. Abreu, G. Araujo-Pardo, C. Balbuena, D. Labbate (2011) on the incidence graphs of an affine and a biaffine plane obtaining two new infinite families of biregular cages and two new semiregular cages. The constructed new families are $({r,2r-3};5)$-cages for all $r=q+1$ with $q$ a prime power, and $({r,2r-5};5)$-cages for all $r=q+1$ with $q$ a prime. The new semiregular cages are constructed for r=5 and 6 with 31 and 43 vertices respectively.

math.CO↗

MOONS: a Multi-Object Optical and Near-infrared Spectrograph for the VLT

MOONS is a new conceptual design for a Multi-Object Optical and Near-infrared Spectrograph for the Very Large Telescope (VLT), selected by ESO for a Phase A study. The baseline design consists of 1000 fibers deployable over a field of view of 500 square arcmin, the largest patrol field offered by the Nasmyth focus at the VLT. The total wavelength coverage is 0.8um-1.8um and two resolution modes: medium resolution and high resolution. In the medium resolution mode (R=4,000-6,000) the entire wavelength range 0.8um-1.8um is observed simultaneously, while the high resolution mode covers simultaneously three selected spectral regions: one around the CaII triplet (at R=8,000) to measure radial velocities, and two regions at R=20,000 one in the J-band and one in the H-band, for detailed measurements of chemical abundances. The grasp of the 8.2m Very Large Telescope (VLT) combined with the large multiplex and wavelength coverage of MOONS - extending into the near-IR - will provide the observational power necessary to study galaxy formation and evolution over the entire history of the Universe, from our Milky Way, through the redshift desert and up to the epoch of re-ionization at z>8-9. At the same time, the high spectral resolution mode will allow astronomers to study chemical abundances of stars in our Galaxy, in particular in the highly obscured regions of the Bulge, and provide the necessary follow-up of the Gaia mission. Such characteristics and versatility make MOONS the long-awaited workhorse near-IR MOS for the VLT, which will perfectly complement optical spectroscopy performed by FLAMES and VIMOS.

astro-ph.IM↗

On the Ubiquity and Utility of Cyclic Schemes

Let $k,l,m,n$, and $μ$ be positive integers. A $\mathbb{Z}_μ$--{\it scheme of valency} $(k,l)$ and {\it order} $(m,n)$ is a $m \times n$ array $(S_{ij})$ of subsets $S_{ij} \subseteq \mathbb{Z}_μ$ such that for each row and column one has $\sum_{j=1}^n |S_{ij}| = k $ and $\sum_{i=1}^m |S_{ij}| = l$, respectively. Any such scheme is an algebraic equivalent of a $(k,l)$-semi-regular bipartite voltage graph with $n$ and $m$ vertices in the bipartition sets and voltages coming from the cyclic group $\mathbb{Z}_μ$. We are interested in the subclass of $\mathbb{Z}_μ$--schemes that are characterized by the property $a - b + c - d\; \not \equiv \;0$ (mod $μ$) for all $a \in S_{ij}$, $b \in S_{ih}$, $c \in S_{gh}$, and $d \in S_{gj}$ where $i,g \in {1,...,m}$ and $j,h \in {1,...,n}$ need not be distinct. These $\mathbb{Z}_μ$--schemes can be used to represent adjacency matrices of regular graphs of girth $\ge 5$ and semi-regular bipartite graphs of girth $\ge 6$. For suitable $ρ, σ\in \mathbb{N}$ with $ρk = σl$, they also represent incidence matrices for polycyclic $(ρμ_k, σμ_l)$ configurations and, in particular, for all known Desarguesian elliptic semiplanes. Partial projective closures yield {\it mixed $\mathbb{Z}_μ$-schemes}, which allow new constructions for Krčadinac's sporadic configuration of type $(34_6)$ and Balbuena's bipartite $(q-1)$-regular graphs of girth 6 on as few as $2(q^2-q-2)$ vertices, with $q$ ranging over prime powers. Besides some new results, this survey essentially furnishes new proofs in terms of (mixed) $\mathbb{Z}_μ$--schemes for ad-hoc constructions used thus far.

math.CO↗

An explicit formula for obtaining $(q+1,8)$-cages and others small regular graphs of girth 8

Let $q$ be a prime power; $(q+1,8)$-cages have been constructed as incidence graphs of a non-degenerate quadric surface in projective 4-space $P(4, q)$. The first contribution of this paper is a construction of these graphs in an alternative way by means of an explicit formula using graphical terminology. Furthermore by removing some specific perfect dominating sets from a $(q+1,8)$-cage we derive $k$-regular graphs of girth 8 for $k= q-1$ and $k=q$, having the smallest number of vertices known so far.

math.CO↗

Families of Small Regular Graphs of Girth 5

In this paper we obtain $(q+3)$--regular graphs of girth 5 with fewer vertices than previously known ones for $q=13,17,19$ and for any prime $q \ge 23$ performing operations of reductions and amalgams on the Levi graph $B_q$ of an elliptic semiplane of type ${\cal C}$. We also obtain a 13-regular graph of girth 5 on 236 vertices from $B_{11}$ using the same technique.

math.CO↗

Irreducible pseudo 2-factor isomorphic cubic bipartite graphs

A bipartite graph is {\em pseudo 2--factor isomorphic} if all its 2--factors have the same parity of number of circuits. In \cite{ADJLS} we proved that the only essentially 4--edge-connected pseudo 2--factor isomorphic cubic bipartite graph of girth 4 is $K_{3,3}$, and conjectured \cite[Conjecture 3.6]{ADJLS} that the only essentially 4--edge-connected cubic bipartite graphs are $K_{3,3}$, the Heawood graph and the Pappus graph. There exists a characterization of symmetric configurations $n_3$ %{\bf decide notation and how to use it in the rest of the paper} due to Martinetti (1886) in which all symmetric configurations $n_3$ can be obtained from an infinite set of so called {\em irreducible} configurations \cite{VM}. The list of irreducible configurations has been completed by Boben \cite{B} in terms of their {\em irreducible Levi graphs}. In this paper we characterize irreducible pseudo 2--factor isomorphic cubic bipartite graphs proving that the only pseudo 2--factor isomorphic irreducible Levi graphs are the Heawood and Pappus graphs. Moreover, the obtained characterization allows us to partially prove the above Conjecture.

math.CO↗

Pseudo and Strongly Pseudo 2--Factor Isomorphic Regular Graphs

A graph $G$ is pseudo 2--factor isomorphic if the parity of the number of cycles in a 2--factor is the same for all 2--factors of $G$. In \cite{ADJLS} we proved that pseudo 2--factor isomorphic $k$--regular bipartite graphs exist only for $k \le 3$. In this paper we generalize this result for regular graphs which are not necessarily bipartite. We also introduce strongly pseudo 2--factor isomorphic graphs and we prove that pseudo and strongly pseudo 2--factor isomorphic 2k--regular graphs and $k$--regular digraphs do not exist for $k\geq 4$. Moreover, we present constructions of infinite families of regular graphs in these classes. In particular we show that the family of Flower snarks is strongly pseudo 2--factor isomorphic but not 2--factor isomorphic and we conjecture that, together with the Petersen and the Blanuša2 graphs, they are the only cyclically 4--edge--connected snarks for which each 2--factor contains only cycles of odd length.

math.CO↗

Adjacency Matrices of Configuration Graphs

In 1960, Hoffman and Singleton \cite{HS60} solved a celebrated equation for square matrices of order $n$, which can be written as $$ (κ- 1) I_n + J_n - A A^{\rm T} = A$$ where $I_n$, $J_n$, and $A$ are the identity matrix, the all one matrix, and a $(0,1)$--matrix with all row and column sums equal to $κ$, respectively. If $A$ is an incidence matrix of some configuration $\cal C$ of type $n_κ$, then the left-hand side $Θ(A):= (κ- 1)I_n + J_n - A A^{\rm T}$ is an adjacency matrix of the non--collinearity graph $Γ$ of $\cal C$. In certain situations, $Θ(A)$ is also an incidence matrix of some $n_κ$ configuration, namely the neighbourhood geometry of $Γ$ introduced by Lefèvre-Percsy, Percsy, and Leemans \cite{LPPL}. The matrix operator $Θ$ can be reiterated and we pose the problem of solving the generalised Hoffman--Singleton equation $Θ^m(A)=A$. In particular, we classify all $(0,1)$--matrices $M$ with all row and column sums equal to $κ$, for $κ= 3,4$, which are solutions of this equation. As a by--product, we obtain characterisations for incidence matrices of the configuration $10_3F$ in Kantor's list \cite{Kantor} and the $17_4$ configuration $#1971$ in Betten and Betten's list \cite{BB99}.

math.CO↗