Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0109191

A Heawood-type result for the algebraic connectivity of graphs on surfaces

Pedro Freitas
View original source ↗Read source document ↗Export metadata ↓

Abstract

We prove that the algebraic connectivity a(G) of a graph embedded on a nonplanar surface satisfies a Heawood-type result. More precisely, it is shown that the algebraic connectivity of a surface S, defined as the supremum of a(G) over all graphs that can be embedded in S, is equal to the chromatic number of S. Furthermore, and with the possible exception of the Klein bottle, we prove that this bound is attained only in the case of the maximal complete graph that can be embedded in S. In the planar case, we show that, at least for some classes of graphs which include the set of regular graphs, a(G) is less than or equal to four. As an application of these results and techniques, we obtain a lower bound for the genus of Ramanujan graphs. We also present some bounds for the asymptotic behaviour of a(G) for certain classes of graphs as the number of vertices goes to infinity.

Explore related subjects

math.COmath.SP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pedro Freitas. 2001-09-24. A Heawood-type result for the algebraic connectivity of graphs on surfaces. https://arxiv.org/abs/math/0109191

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗