Abstract: Pinning control has been attracting wide attention for the study of various complex networks for decades. This article explores grounded theory on the pinning synchronization of the emerging ...
ABSTRACT: We study the mixing rate of non-backtracking random walks on graphs by looking at non-backtracking walks as walks on the directed edges of a graph. A result known as Ihara’s Theorem relates ...
ABSTRACT: In this paper we study the relationship between minimum rank of graph G and the minimum rank of graph for some families of special graph G, where is the jth power of graph G.
Abstract: Spectral graph theory is the study of the eigenvalues and eigenvectors of matrices associated with graphs. In this tutorial, we will try to provide some intuition as to why these ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results