Coloring of character graphs

被引：1

作者：

Ebrahimi, Mahdi ^{[1
]}

Iranmanesh, Ali ^{[1
]}

机构：

[1] Tarbiat Modares Univ, Fac Math Sci, Dept Math, POB 14115-137, Tehran, Iran

来源：

COMMUNICATIONS IN ALGEBRA | 2017年 / 45卷 / 01期

关键词：

Character graph; chromatic number; solvable group; CONJUGACY CLASS SIZES; SOLVABLE-GROUPS; FINITE-GROUPS; DIAMETER-3;

D O I：

10.1080/00927872.2016.1175588

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In this paper, we study the character graph (G) of a finite solvable group G. We prove that sum of the chromatic number of (G) and the matching number of complement graph of (G) is equal to the order of (G). Also, we prove that when (G) is not a block, the chromatic number of (G) is equal to the clique number of (G).

引用

页码：227 / 233

页数：7