3 search results - page 1 / 1 » The Diameter and Laplacian Eigenvalues of Directed Graphs |
COMBINATORICS
2006
13 years 4 months ago
2006
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...
COMBINATORICS
2006
13 years 4 months ago
2006
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. ...
CIVR
2007
Springer
13 years 10 months ago
2007
Springer
Ensuring the uniqueness of trademark images and protecting their identities are the most important objectives for the trademark registration process. To prevent trademark infringe...