Sciweavers

Share
3 search results - page 1 / 1
» The Diameter and Laplacian Eigenvalues of Directed Graphs
Sort
View
COMBINATORICS
2006
169views more  COMBINATORICS 2006»
8 years 6 months ago
The Diameter and Laplacian Eigenvalues of Directed Graphs
For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly con...
Fan R. K. Chung
COMBINATORICS
2006
221views more  COMBINATORICS 2006»
8 years 6 months ago
Kernels of Directed Graph Laplacians
Abstract. Let G denote a directed graph with adjacency matrix Q and indegree matrix D. We consider the Kirchhoff matrix L = D - Q, sometimes referred to as the directed Laplacian. ...
John S. Caughman IV, J. J. P. Veerman
CIVR
2007
Springer
178views Image Analysis» more  CIVR 2007»
9 years 20 days ago
Layout indexing of trademark images
Ensuring the uniqueness of trademark images and protecting their identities are the most important objectives for the trademark registration process. To prevent trademark infringe...
Reinier H. van Leuken, M. Fatih Demirci, Victoria ...
books