Benutzer: Gast  Login
Autor(en):
Hanjo Täubig 
Titel:
Further Results on the Number of Walks in Graphs and Weighted Entry Sums of Matrix Powers 
Abstract:
We consider the number of walks in undirected and directed graphs and, more generally, the weighted sum of entries of matrix powers. In this respect, we generalize an earlier result for Hermitian matrices. By using these inequalities for the entry sum of matrix powers, we deduce similar inequalities for iterated kernels. For further conceivable inequalities, we provide counterexamples in the form of graphs that contradict the corresponding statement for the number of walks....    »
 
Stichworte:
inequalities, graph, number of walks, hermitian matrix, nonnegative matrix, matrix powers, sum of elements, spectral radius, largest eigenvalue, iterated kernel, iterated line graph 
Jahr:
2014 
Sprache:
en