An Alon-Boppana Type Bound for Weighted Graphs and Lowerbounds for Spectral Sparsification

doi 10.1137/1.9781611975031.85
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Spectral Sparsification of Hypergraphs

2019English

Euclidean Distances, Soft and Spectral Clustering on Weighted Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

An Improved Upper Bound for the Order of Mixed Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2018English

An Upper Bound for the Chromatic Number of Line Graphs

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2007English

Turán Problems for Integer-Weighted Graphs

Journal of Graph Theory
GeometryTopology
2002English

Spectral Estimates for Infinite Quantum Graphs

Calculus of Variations and Partial Differential Equations
Applied MathematicsAnalysis
2018English

Spectral Estimates for Abelian Cayley Graphs

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2006English

A Sampling Theory for Infinite Weighted Graphs

Opuscula Mathematica
Mathematics
2011English

An Erdős-Gallai Type Theorem for Vertex Colored Graphs

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy