Abstract: This paper proposes a compression framework for adjacency matrices of weighted graphs based on graph filter banks. Adjacency matrices are widely used mathematical representations of graphs ...

ABSTRACT: For a simple undirected graph G, let A( G ) be the (0, 1) adjacency matrix of G. The Seidel matrix of G, is defined as S( G )=J−I−2A( G ) , where J is the all-one matrix and I is the ...

Department of Mathematics and Statistics, Qinghai Minzu University, Xining, China. Since then, much attention has been paid to this topic, but they mainly focus on undirected graphs and integral trees ...

The Department of Marine Technology, Ocean University of China, Qingdao, China Coverage path planning (CPP) for target search by autonomous unmanned vehicle (AUV) involves two crucial aspects: (1) the ...

Add a description, image, and links to the adjacency-matrix-graph topic page so that developers can more easily learn about it.

1 College of Computer Science and Engineering, Guilin University of Technology, Guilin, China 2 Guangxi Key Laboratory of Embedded Technology and Intelligent Systems, Guilin University of Technology, ...

Characterizing the representations encoded in patterns of neural activity is key to understanding brain computation. Representational similarity analysis uses the geometry of neural population ...

Abstract: Computing the product of the (binary) adjacency matrix of a large graph with a real-valued vector is an important operation that lies at the heart of various graph analysis tasks, such as ...