Results 271 to 280 of about 232,364 (309)
Wavelets on graphs via spectral graph theory
Applied and Computational Harmonic Analysis, 2011 We propose a novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite weighted graph. Our approach is based on defining scaling using the the graph analogue of the Fourier domain, namely the spectral decomposition of the discrete graph Laplacian $Ł$.
Rémi Gribonval
exaly +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Spectral Graph Theory and its Applications
Annual Symposium on Foundations of Computer Science, 2007Daniel A Spielman
exaly +4 more sources
Three conjectures in extremal spectral graph theory
Journal of Combinatorial Theory Series B, 2017 We prove three conjectures regarding the maximization of spectral invariants over certain families of graphs. Our most difficult result is that the join of $P_2$ and $P_{n-2}$ is the unique graph of maximum spectral radius over all planar graphs. This was conjectured by Boots and Royle in 1991 and independently by Cao and Vince in 1993.
Michael Tait
exaly +4 more sources
Spectral Graph Theory and Network Dependability
2009 Fourth International Conference on Dependability of Computer Systems, 2009The paper introduces methods of graph theory for ranking substations of an electric power grid. In particular, spectral graph theory is used and several ranking algorithms are described.
Alvaro Torres, George J. Anders
openaire +1 more source
Downsampling graphs using spectral theory
2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2011In this paper we present methods for downsampling datasets defined on graphs (i.e., graph-signals) by extending downsampling results for traditional N-dimensional signals. In particular, we study the spectral properties of k-regular bipartite graphs (K-RBG) and prove that downsampling in these graphs is governed by a Nyquist-like criteria.
Sunil K. Narang, Antonio Ortega
openaire +1 more source
On Two Conjectures of Spectral Graph Theory
Bulletin of the Iranian Mathematical Society, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Das, Kinkar Ch., Liu, Muhuo
openaire +2 more sources
2015
The concept of the line graph of a given graph is so natural that it has been independently discovered by many authors. Of course, each author gave it a different name: It was called the interchange graph by Ore [272], derivative by H. Sachs [297], derived graph by L. W. Beineke [52], edge-to-vertex dual by M.
openaire +1 more source
The concept of the line graph of a given graph is so natural that it has been independently discovered by many authors. Of course, each author gave it a different name: It was called the interchange graph by Ore [272], derivative by H. Sachs [297], derived graph by L. W. Beineke [52], edge-to-vertex dual by M.
openaire +1 more source