25 citations · 53 across the 8 of their papers we have counts for
9 papers
Maximum walk entropy implies walk regularity
Ernesto Estrada, Jose A. de la Pena
The notion of walk entropy for a graph at the inverse temperature was put forward recently by Estrada et al. (2014) \cite{6}. It was further proved by Benzi \cit…
On d-Walk Regular Graphs
Ernesto Estrada, Jose A. de la Pena
Let G be a graph with set of vertices 1,...,n and adjacency matrix A of size nxn. Let d(i,j)=d, we say that f_d:N->N is a d-function on G if for every pair of vertices i,j and k>=d…
Walk Entropies in Graphs
Ernesto Estrada, Jose A. de la Pena, Naomichi Hatano
Entropies based on walks on graphs and on their line-graphs are defined. They are based on the summation over diagonal and off-diagonal elements of the thermal Green's function of…
On the number of terms in the middle of almost split sequences over cycle-finite artin algebras
Piotr Malicki, José A. de la Peña, Andrzej Skowroński
We prove that the number of terms in the middle of an almost split sequence in the module category of a cycle-finite artin algebra is bounded by 5.
From Integer Sequences to Block Designs via Counting Walks in Graphs
Ernesto Estrada, José A. de la Peña
We define numbers of the type Oj(N) and Ej(N) and the corresponding integer sequences. We prove that these integer sequences, e.g., SO(N) and SE(N) correspond to the number of odd…
Algebras whose Tits form accepts a maximal omnipresent root
José A. de la Peña, Andrzej Skowroński
Let k be an algebraically closed field and A be a finite-dimensional associative basic k-algebra of the form A=kQ/I where Q is a quiver without oriented cycles or double arrows and…