Javascript must be enabled to continue!
Alon–Boppana-Type Bounds for Weighted Graphs
View through CrossRef
The unraveled ball of radius $r$ centered at a vertex $v$ in a weighted graph $G$ is the ball of radius $r$ centered at $v$ in the universal cover of $G$. We present a general bound on the maximum spectral radius of unraveled balls of fixed radius in a weighted graph.
The weighted degree of a vertex in a weighted graph is the sum of weights of edges incident to the vertex. A weighted graph is called regular if the weighted degrees of its vertices are the same. Using the result on unraveled balls, we prove a variation of the Alon–Boppana theorem for regular weighted graphs.
The Electronic Journal of Combinatorics
Title: Alon–Boppana-Type Bounds for Weighted Graphs
Description:
The unraveled ball of radius $r$ centered at a vertex $v$ in a weighted graph $G$ is the ball of radius $r$ centered at $v$ in the universal cover of $G$.
We present a general bound on the maximum spectral radius of unraveled balls of fixed radius in a weighted graph.
The weighted degree of a vertex in a weighted graph is the sum of weights of edges incident to the vertex.
A weighted graph is called regular if the weighted degrees of its vertices are the same.
Using the result on unraveled balls, we prove a variation of the Alon–Boppana theorem for regular weighted graphs.
Related Results
Cycle connectivity in weighted graphs
Cycle connectivity in weighted graphs
Some new connectivity concepts in weighted graphs are introduced in this article. The concepts of strong arc, partial cutnode, bridge and block are introduced. Also three different...
Volume Bounds for Trivalent Planar Graphs
Volume Bounds for Trivalent Planar Graphs
This paper studies the volumes of hyperbolic planar trivalent graphs. The connection between fully augmented links and trivalent planar graphs allows us to apply previous work on k...
Subexponential lower bounds for f-ergodic Markov processes
Subexponential lower bounds for f-ergodic Markov processes
AbstractWe provide a criterion for establishing lower bounds on the rate of convergence in f-variation of a continuous-time ergodic Markov process to its invariant measure. The cri...
Twilight graphs
Twilight graphs
AbstractThis paper deals primarily with countable, simple, connected graphs and the following two conditions which are trivially satisfied if the graphs are finite:(a) there is an ...
On Tuza's conjecture in even co-chain graphs
On Tuza's conjecture in even co-chain graphs
In 1981, Tuza conjectured that the cardinality of a minimum set of edges that intersects every triangle of a graph is at most twice the cardinality of a maximum set of edge-disjoin...
Model-checking ecological state-transition graphs
Model-checking ecological state-transition graphs
AbstractModel-checking is a methodology developed in computer science to automatically assess the dynamics of discrete systems, by checking if a system modelled as a state-transiti...
A Systematic Review on Knowledge Graphs Classification and Their Various Usages
A Systematic Review on Knowledge Graphs Classification and Their Various Usages
A Knowledge Graph is a directive graph where the nodes state the entities and the edges describe the relationships between the entities of data. It is also referred to as a Semanti...
Lower Bounds on Mutual Information of QPSK and BPSK in General Memoryless channels
Lower Bounds on Mutual Information of QPSK and BPSK in General Memoryless channels
Abstract
We derive novel lower bounds on the mutual information in general memoryless channels with quadrature-phase-shift-keying (QPSK) or binary-phase-shift-keying (BPSK)...

