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 ...
Scientific Research Publishing

The Seidel Eigenvalues Polynomial and Spectrum of the Petersen Graph ()

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

Exploiting Computation-Friendly Graph Compression Methods for Adjacency-Matrix Multiplication

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 ...
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 ...
Scientific Research Publishing

Bondy, J.A. and Murty, U.S.R. (1976) Graph Theory with Applications. Macmillan, London and Elsevier.

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

Graph Structure Learning for Traffic Prediction

This repository introduces a novel approach to traffic prediction by incorporating Graph Structure Learning (GSL) techniques. We enhance two fundamental architectures - the Graph Convolutional Network ...
GitHub

C program that creates a graph and perform some actions within the graph

There was an error while loading. Please reload this page. Title:Graph and operations Project Description: This project provides an implementation of a graph using an ...