" This is the first book to comprehensively cover chromatic polynomials of graphs. It includes
most of the known results and unsolved problems in the area of chromatic polynomials …

Let β (G) denote the minimum real root of the σ-polynomial of the complement of a graph G
and δ (G) the minimum degree of G. In this paper, we give a characterization of all …

CHROMATICITY AND ADJOINT POLYNOMIALS OF GRAPHS Page 1 CHROMATICITY AND
ADJOINT POLYNOMIALS OF GRAPHS Page 2 c H. Zhao, Enschede, 2005 No part of this work …

Let G be a graph with order n and G¯ its complement. Denote by β (G) the minimum real root
of the adjoint polynomial of G. Two graphs G and H are chromatically equivalent if and only if …

For a graph G, let h (G, x) denote its adjoint polynomial and β (G) denote the minimum real
root of h (G, x). Two graphs H and G are said to be adjointly equivalent if h (H, x)= h (G, x) …

两个图G 和H 色等价当且仅当它们的补图伴随等价. 图G 色唯一当且仅当G 伴随唯一.
在这篇文章中, 我们计算了rK 1 UC m (r≥ 1, m≥ 3) 的伴随等价图的个数 …

Pl∪Cm∪Dn的补图的色等价刻画和色惟一的条件 首页 期刊介绍 编委会 政策指南 期刊订阅 联系
我们 English 您的位置:山东大学 -> 科技期刊社 -> 《山东大学学报(理学版)》 J4 • 论文• 上一篇 下一 …

By h (G, x) and P (G, λ) we denote the adjoint polynomial and the chromatic polynomial of a
graph G, respectively. A new invariant of graph G, which is the fourth character R4 (G), is …

By h (G, x) and P (G, λ) we denote the adjoint polynomial and the chromatic polynomial of
graph G, respectively. A new invariant of graph G, which is the fourth character R₄ (G), is …