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.

Abstract: Graph theory has played a vital role in implementation of many mathematical and computer applications [8]. The immensely critical role of graph theory calls for an efficient methodology of ...

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

Recent advances in image acquisition and processing techniques, along with the success of novel deep learning architectures, have given the opportunity to develop innovative algorithms capable to ...