Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Shokoufandeh, A.
Dickinson, S.J.
Siddiqi, K.
and
Zucker, S.W.
1999.
Indexing using a spectral encoding of topological structure.
p.
491.
Cvetković, Dragoš
and
Fowler, Patrick W.
1999.
A Group-Theoretical Bound for the Number of Main Eigenvalues of a Graph.
Journal of Chemical Information and Computer Sciences,
Vol. 39,
Issue. 4,
p.
638.
Stevanović, Dragan
2000.
When can the components of NEPS of connected bipartite graphs be almost cospectral?.
Linear Algebra and its Applications,
Vol. 311,
Issue. 1-3,
p.
35.
Durna, M.
Erkmen, I.
and
Erkmen, A.M.
2000.
Self-reconfiguration in task space of a holonic structure.
Vol. 3,
Issue. ,
p.
2366.
Papendieck, Britta
and
Recht, Peter
2000.
On maximal entries in the principal eigenvector of graphs.
Linear Algebra and its Applications,
Vol. 310,
Issue. 1-3,
p.
129.
Durna, M.
Erkmen, A.M.
and
Erkmen, I.
2000.
Self-localization of a holon in the reconfiguration task space of a robotic colony.
Vol. 2,
Issue. ,
p.
1748.
Godsil, Chris
and
Royle, Gordon
2001.
Algebraic Graph Theory.
Vol. 207,
Issue. ,
p.
163.
Gutman, Ivan
Rücker, Christoph
and
Rücker, Gerta
2001.
On Walks in Molecular Graphs.
Journal of Chemical Information and Computer Sciences,
Vol. 41,
Issue. 3,
p.
739.
Cvetković, D.
Simić, S.
Caporossi, G.
and
Hansen, P.
2001.
Variable neighborhood search for extremal graphs 3.
Linear and Multilinear Algebra,
Vol. 49,
Issue. 2,
p.
143.
Gregory, DavidA.
Hershkowitz, Daniel
and
Kirkland, StephenJ.
2001.
The spread of the spectrum of a graph.
Linear Algebra and its Applications,
Vol. 332-334,
Issue. ,
p.
23.
Santini, Simone
2002.
Multimodal search in collections of images and text.
Journal of Electronic Imaging,
Vol. 11,
Issue. 4,
p.
455.
Cvetković, Dragoš
Fowler, Patrick
Rowlinson, Peter
and
Stevanović, Dragan
2002.
Constructing fullerene graphs from their eigenvalues and angles.
Linear Algebra and its Applications,
Vol. 356,
Issue. 1-3,
p.
37.
Rücker, Christoph
Rücker, Gerta
and
Meringer, Markus
2002.
Exploring the Limits of Graph Invariant- and Spectrum-Based Discrimination of (Sub)structures.
Journal of Chemical Information and Computer Sciences,
Vol. 42,
Issue. 3,
p.
640.
Shokoufandeh, Ali
and
Dickinson, Sven
2002.
Theoretical Aspects of Computer Science.
Vol. 2292,
Issue. ,
p.
148.
Oliveira, Carla Silva
Maia de Abreu, Nair Maria
and
Jurkiewicz, Samuel
2002.
The characteristic polynomial of the Laplacian of graphs in (a,b)-linear classes.
Linear Algebra and its Applications,
Vol. 356,
Issue. 1-3,
p.
113.
Glavaski, S.
Chaves, M.
Day, R.
Nag, P.
Williams, A.
and
Wei Zhang
2003.
Vehicle networks: achieving regular formation.
Vol. 5,
Issue. ,
p.
4095.
Daneshgar, Amir
and
Hajiabolhassan, Hossein
2003.
Graph homomorphisms through random walks.
Journal of Graph Theory,
Vol. 44,
Issue. 1,
p.
15.
Bell, Francis K.
2003.
Line graphs of bipartite graphs with Hamiltonian paths.
Journal of Graph Theory,
Vol. 43,
Issue. 2,
p.
137.
Blondel, Vincent D.
and
Van Dooren, Paul
2003.
Automata, Languages and Programming.
Vol. 2719,
Issue. ,
p.
739.
Akuzawa, K.
and
Ohnishi, K.
2003.
Design indices for information connection in decentralized system.
Vol. 3,
Issue. ,
p.
2417.