pith. sign in

arxiv: 1712.02023 · v1 · pith:ENX3KU24new · submitted 2017-12-06 · 🧮 math.CO

The vertex-isoperimetric number of the incidence andnon-incidence graphs of unitals

classification 🧮 math.CO
keywords numbervertex-isoperimetricincidencegraphsunitalunitalsvaluearcs
0
0 comments X
read the original abstract

We derive upper and lower bounds for the vertex-isoperimetric number of the incidence graphs of unitals and determine its order of magnitude. In the case when a unital contains sufficiently large arcs, these bounds agree and give rise to the precise value of this parameter. In particular, we obtain the exact value of the vertex-isoperimetric number of the incidence graphs of classical unitals and a certain subfamily of BM-unitals. In the case when the maximum size of arcs in the unital is relatively small, we obtain an upper bound for this parameter in terms of the vertex-isoperimetric number of the incidence graph. We also determine the exact value of the vertex-isoperimetric number of the non-incidence graph of any unital.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.