40,028 research outputs found
Spectral Bounds for the Connectivity of Regular Graphs with Given Order
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a
graph are measures of its connectivity. These eigenvalues can be used to
analyze the robustness, resilience, and synchronizability of networks, and are
related to connectivity attributes such as the vertex- and edge-connectivity,
isoperimetric number, and characteristic path length. In this paper, we present
two upper bounds for the second-largest eigenvalues of regular graphs and
multigraphs of a given order which guarantee a desired vertex- or
edge-connectivity. The given bounds are in terms of the order and degree of the
graphs, and hold with equality for infinite families of graphs. These results
answer a question of Mohar.Comment: 24 page
The non-bipartite integral graphs with spectral radius three
In this paper, we classify the connected non-bipartite integral graphs with
spectral radius three.Comment: 18 pages, 5 figures, 2 table
Unimodular graphs and Eisenstein sums
Motivated in part by combinatorial applications to certain sum-product
phenomena, we introduce unimodular graphs over finite fields and, more
generally, over finite valuation rings. We compute the spectrum of the
unimodular graphs, by using Eisenstein sums associated to unramified extensions
of such rings. We derive an estimate for the number of solutions to the
restricted dot product equation over a finite valuation ring.
Furthermore, our spectral analysis leads to the exact value of the
isoperimetric constant for half of the unimodular graphs. We also compute the
spectrum of Platonic graphs over finite valuation rings, and products of such
rings - e.g., . In particular, we deduce an improved lower
bound for the isoperimetric constant of the Platonic graph over
.Comment: V2: minor revisions. To appear in the Journal of Algebraic
Combinatoric
Extrema of graph eigenvalues
In 1993 Hong asked what are the best bounds on the 'th largest eigenvalue
of a graph of order . This challenging question has
never been tackled for any . In the present paper tight bounds are
obtained for all and even tighter bounds are obtained for the 'th
largest singular value
Some of these bounds are based on Taylor's strongly regular graphs, and other
on a method of Kharaghani for constructing Hadamard matrices. The same kind of
constructions are applied to other open problems, like Nordhaus-Gaddum problems
of the kind: How large can be
These constructions are successful also in another open question: How large
can the Ky Fan norm be
Ky Fan norms of graphs generalize the concept of graph energy, so this question
generalizes the problem for maximum energy graphs.
In the final section, several results and problems are restated for
-matrices, which seem to provide a more natural ground for such
research than graphs.
Many of the results in the paper are paired with open questions and problems
for further study.Comment: 32 page
- …