GitHub

Data Structures and Algorithms in C

An implementation of data structures and algorithms in C, including intrusive linked list, generic vector, hash table, index priority queue, adjacency list representation of graph, and so on. This ...
IEEE

Lossy Compression of Adjacency Matrices by Graph Filter Banks

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

An Approach for Solving the Graph Coloring Problem using Adjacency Matrix

Abstract: Coloring a graph is a known and a classical problem in graph theory. It is also a known NP problem. In a graph G, the solution of coloring a graph is about coloring all the vertices of the ...
JSTOR Daily

ON THE α-SPECTRAL RADIUS OF GRAPHS

For 0 ≤ α ≤ 1, Nikiforov proposed to study the spectral properties of the family of matrices Aα(G) = αD(G)+(1−α)A(G) of a graph G, where D(G) is the degree diagonal matrix and A(G) is the adjacency ...