An Approach To Solve Graph Coloring Problem Using Adjacency Matrix

Ajay Narayan Shukla; Madan Lal Garg

doi:10.21786/bbrc/12.2/33

ScienceGate Book Chapters

JOURNAL ARTICLE

An Approach To Solve Graph Coloring Problem Using Adjacency Matrix

Ajay Narayan Shukla Madan Lal Garg

Year: 2019 Journal: Bioscience Biotechnology Research Communications Vol: 12 (2)Pages: 472-477

DOI: 10.21786/bbrc/12.2/33

Get Full-Text PDF Get Analytical Report

Keywords:

Adjacency matrix Graph coloring Greedy coloring Fractional coloring List coloring Computer science Adjacency list Graph Complete coloring Mathematics Combinatorics Theoretical computer science Graph power Line graph

Metrics

Cited By

0.42

FWCI (Field Weighted Citation Impact)

Refs

0.67

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Scheduling and Timetabling Solutions

Social Sciences → Decision Sciences → Management Science and Operations Research

Vehicle Routing Optimization Methods

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

An Approach To Solve Graph Coloring Problem Using Adjacency Matrix

Metrics

Citation History

Topics

Related Documents

Solving Graph Coloring Problem Using Graph Adjacency Matrix Algorithm

Solving Graph Coloring Problem Using Graph Adjacency Matrix Algorithm

An Approach for Solving the Graph Coloring Problem using Adjacency Matrix

Using Graph Isomorphism Network to Solve Graph Coloring Problem

A List based Approach to Solve Graph Coloring Problem