We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adjacency matrix. For all known distance-regular graphs it is determined whether they are 3-chromatic. A start is made with the classification of 3-chromatic distance-regular graphs, and it is shown that such graphs, if not complete 3-partite, must have ¿ = 1
Abstract. We characterize the distance-regular graphs with diameter three by giving an expression fo...
We characterize the distance-regular graphs with diameter three by giving an expression for the numb...
AbstractWe deal with the question: Can one see from the spectrum of a graph Г whether it is distance...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
AbstractSuppose D is a subset of all positive integers L. The distance graph G(L,D) is the graph wit...
Suppose D is a subset of all positive integers Z. The distance graph G(Z; D) is the graph with verte...
AbstractFor all l ⩾ 10 and u ⩾ l2 − 6l + 3 the chromatic number is proved to be 3 for distance graph...
Abstract. We characterize the distance-regular graphs with diameter three by giving an expression fo...
We characterize the distance-regular graphs with diameter three by giving an expression for the numb...
AbstractWe deal with the question: Can one see from the spectrum of a graph Г whether it is distance...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
AbstractSuppose D is a subset of all positive integers L. The distance graph G(L,D) is the graph wit...
Suppose D is a subset of all positive integers Z. The distance graph G(Z; D) is the graph with verte...
AbstractFor all l ⩾ 10 and u ⩾ l2 − 6l + 3 the chromatic number is proved to be 3 for distance graph...
Abstract. We characterize the distance-regular graphs with diameter three by giving an expression fo...
We characterize the distance-regular graphs with diameter three by giving an expression for the numb...
AbstractWe deal with the question: Can one see from the spectrum of a graph Г whether it is distance...
DOI
Add to ORKG