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

AxelSierra1/kruskal-dijkstra-cpp

This project implements a graph data structure using an adjacency matrix. It allows users to create, modify, and analyze graphs, including running algorithms like Dijkstra's for shortest paths and ...
GitHub

This project features code for an undirected graph, read from a .txt file. It generates the adjacency list and matrices and implements algorithms such as Dijkstra's, Minimum ...

Introduction: This project models a parcel delivery system in the city using graph theory. The objective is to optimize the courier's delivery routes, minimizing the total distance traveled and 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 ...
IEEE

Learning Mixed Membership from Adjacency Graph Via Systematic Edge Query: Identifiability and Algorithm

Abstract: Graph clustering is a core technique for network analysis problems, e.g., community detection. This work puts forth a node clustering approach for largely incomplete adjacency graphs. Under ...