Title of article
Number of walks and degree powers in a graph
Author/Authors
Fiol، نويسنده , , M.A. and Garriga، نويسنده , , E.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
2
From page
2613
To page
2614
Abstract
This note deals with the relationship between the total number of k -walks in a graph, and the sum of the k -th powers of its vertex degrees. In particular, it is shown that the the number of all k -walks is upper bounded by the sum of the k -th powers of the degrees.
Keywords
Laplacian matrix , Walks , graph , Degree powers , Adjacency matrix
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598741
Link To Document