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...
Computing the Energy of Certain Graphs based on Vertex Status
Computing the Energy of Certain Graphs based on Vertex Status
Background:
The concept of Hückel molecular orbital theory is used to compute the graph energy numerically and graphically on the base of the status of a vertex.
Objective:
Our a...
Eigenspectral Analysis of Pendant Vertex- and Pendant Edge-Weighted Graphs of Linear Chains, Cycles, and Stars
Eigenspectral Analysis of Pendant Vertex- and Pendant Edge-Weighted Graphs of Linear Chains, Cycles, and Stars
Abstract
Three classes of pendent vertex- and pendant edge-weighted graphs of linear chains (class I), stars (class II), and cycles (class III) have been presented. ...
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...
Abstract P4-01-06: Evaluation of 3D T2-weighted Breast MRI
Abstract P4-01-06: Evaluation of 3D T2-weighted Breast MRI
Abstract
Background: Although the dynamic contrast enhanced (DCE) sequence has long been considered the most important sequence to characterize benign and malignant ...
Increased life expectancy of heart failure patients in a rural center by a multidisciplinary program
Increased life expectancy of heart failure patients in a rural center by a multidisciplinary program
Abstract
Funding Acknowledgements
Type of funding sources: None.
INTRODUCTION Patients with heart failure (HF)...
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 ...

