The Adjacency Matrix and Graph Coloring
نویسنده
چکیده
These notes are not necessarily an accurate representation of what happened in class. The notes written before class say what I think I should say. I sometimes edit the notes after class to make them way what I wish I had said. There may be small mistakes, so I recommend that you check any mathematically precise statement before using it in your own work. These notes were last revised on September 13, 2015.
منابع مشابه
A practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملLower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices
A lower bound on the chromatic number of a graph is derived by majorization of spectra of weighted adjacency matrices. These matrices are given by Hadamard products of the adjacency matrix and arbitrary Hermitian matrices.
متن کاملUnified spectral bounds on the chromatic number
One of the best known results in spectral graph theory is the following lower bound on the chromatic number due to Alan Hoffman, where μ1 and μn are respectively the maximum and minimum eigenvalues of the adjacency matrix: χ ≥ 1+μ1/−μn. We recently generalised this bound to include all eigenvalues of the adjacency matrix. In this paper, we further generalize these results to include all eigenva...
متن کاملFast Practical Algorithm Based on Weisfeiler-lehman Method for Graph Isomorphism
Graph isomorphism problem is to determine whether two given graphs are isomorphic. It is a particular type of a more general problem “the isomorphism of incidence system”. I propose some new invariants for heuristic search of graph isomorphism and demonstrate that they are really useful in practice by experiments. Keyword. graph isomorphism, graph invariant, graph spectrum , adjacency matrix, m...
متن کاملSpectral Bounds on the Chromatic Number
The purpose of this paper is to discuss spectral bounds on the chromatic number of a graph. The classic result by Hoffman, where λ1 and λn are respectively the maximum and minimum eigenvalues of the adjacency matrix of a graph G, is χ(G) ≥ 1− λ1 λn . It is possible to discuss the coloring of Hermitian matrices in general. Nikiforov developed a spectral bound on the chromatic number of such matr...
متن کامل