Sciweavers

132 search results - page 1 / 27
» Simplices and Spectra of Graphs
Sort
View
51
Voted
DCG
2010
122views more  DCG 2010»
14 years 10 months ago
Simplices and Spectra of Graphs
Bojan Mohar, Igor Rivin
PR
2008
206views more  PR 2008»
14 years 10 months ago
A study of graph spectra for comparing graphs and trees
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
Richard C. Wilson, Ping Zhu
COMBINATORICS
2007
100views more  COMBINATORICS 2007»
14 years 10 months ago
Revisiting Two Classical Results on Graph Spectra
Let µ (G) and µmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G. Our main results are: (i) If H is a proper subgraph of a connected graph G o...
Vladimir Nikiforov
89
Voted
OOPSLA
2007
Springer
15 years 4 months ago
No ifs, ands, or buts: uncovering the simplicity of conditionals
Schematic tables are a new representation for conditionals. Roughly a cross between decision tables and data flow graphs, they represent computation and decision-making orthogona...
Jonathan Edwards
CVIU
2008
113views more  CVIU 2008»
14 years 10 months ago
Indexing through laplacian spectra
With ever growing databases containing multimedia data, indexing has become a necessity to avoid a linear search. We propose a novel technique for indexing multimedia databases in...
M. Fatih Demirci, Reinier H. van Leuken, Remco C. ...