132 search results - page 4 / 27 » Simplices and Spectra of Graphs |
JSYML
2007
14 years 9 months ago
2007
We consider embeddings of structures which preserve spectra: if g : M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (a...
GBRPR
2005
Springer
15 years 2 months ago
2005
Springer
In this paper we explore how a spectral technique suggested by quantum walks can be used to distinguish non-isomorphic cospectral graphs. Reviewing ideas from the field of quantum...
75
Voted
SDM
2009
SIAM
15 years 6 months ago
2009
SIAM
Social networks tend to contain some amount of randomness and some amount of non-randomness. The amount of randomness versus non-randomness affects the properties of a social netw...
DAM
2008
14 years 9 months ago
2008
13 An induced matching of a graph G is a matching having no two edges joined by14 an edge. An efficient edge dominating set of G is an induced matching M such that15 every other ed...
ICIP
1998
IEEE
15 years 11 months ago
1998
IEEE
Velocity spectra of a flow can be made by ultrasound Doppler measurements. Using only part of the information in these spectra, it is possible to reconstruct the solenoid part and...