3,003 research outputs found
The spectrum of Platonic graphs over finite fields
AbstractWe give a decomposition theorem for Platonic graphs over finite fields and use this to determine the spectrum of these graphs. We also derive estimates for the isoperimetric numbers of the graphs
On The Isoperimetric Spectrum of Graphs and Its Approximations
In this paper we consider higher isoperimetric numbers of a (finite directed)
graph. In this regard we focus on the th mean isoperimetric constant of a
directed graph as the minimum of the mean outgoing normalized flows from a
given set of disjoint subsets of the vertex set of the graph. We show that
the second mean isoperimetric constant in this general setting, coincides with
(the mean version of) the classical Cheeger constant of the graph, while for
the rest of the spectrum we show that there is a fundamental difference between
the th isoperimetric constant and the number obtained by taking the minimum
over all -partitions. In this direction, we show that our definition is the
correct one in the sense that it satisfies a Federer-Fleming-type theorem, and
we also define and present examples for the concept of a supergeometric graph
as a graph whose mean isoperimetric constants are attained on partitions at all
levels. Moreover, considering the -completeness of the isoperimetric
problem on graphs, we address ourselves to the approximation problem where we
prove general spectral inequalities that give rise to a general Cheeger-type
inequality as well. On the other hand, we also consider some algorithmic
aspects of the problem where we show connections to orthogonal representations
of graphs and following J.~Malik and J.~Shi () we study the close
relationships to the well-known -means algorithm and normalized cuts method
Growth and isoperimetric profile of planar graphs
Let G be a planar graph such that the volume function of G satisfies V(2n)<
CV(n) for some constant C > 0. Then for every vertex v of G and integer n,
there is a domain \Omega such that B(v,n) \subset \Omega, \Omega \subset B(v,
6n) and the size of the boundary of \Omega is at most order n.Comment: 8 page
- …