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

THE RANK OF DILUTED RANDOM GRAPHS

We investigate the rank of the adjacency matrix of large diluted random graphs: for a sequence of graphs (G n ) n≥0 converging locally to a Galton—Watson tree T (GWT), we provide an explicit formula ...
Scientific Research Publishing

Huang, Y.D., Di, C.G. and Zhu, S.X. (2002) Matrix Theory and Its Application. University of Science and Technology of China Press.

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 ...
JSTOR Daily

The Change in the Least Eigenvalue of the Adjacency Matrix of a Graph Under Imbedding

Let G be a graph, A(G) be the adjacency matrix of G, and λ(G) the least eigenvalue of A(G). Information is given about the following three quantities: $\lambda_R(G ...
GitHub

A high level interface for manipulating graph theory objects in C

This is designed to be a standalone library written in pure C99. This project was initially an assignment which was supposed to be written in Python. I didn't really think Python was the appropriate ...