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 and are ...

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 identity ...

Let G be a graph of order n and let S be any subset of the vertex set V(G). Denote by GS the graph obtained from the graph G by adding a new vertex x which is adjacent exactly to the vertices from S.

This is a survey paper on the second largest eigenvalue λ₂ of the adjacency matrix of a graph. Among the topics presented are the graphs with small λ₂, bounds for λ₂, algebraic connectivity, 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 ...