图的b色数和外控制数.pdfVIP

摘 要 摘 要 图的-着色是指图有一个正常着色, 且每个色类至少包含一个点, 使得它在其它 所有色类中有邻点. 满足上述性质的点叫做颜色控制点. 图的-色数 ()是指图有一 个-着色, 且使用最多的颜色数. 在本文中, 我们否定了由Jakovac 和Peterin (Studia Sci. Math. Hungar. 49(2012) 156-169) 提出的关于图的-着色的强直积和字典积的两个猜测. 我们定义 ( )为围长至少为且 () = 的图的最少顶点数. 我们确定了 ( 3), ( 4), ( ∞) 我们说一个顶点子集是图的外连通控制集, 如果集合外的点在集合 中都有 邻点, 且由 \ 导出子图是连通的. 图的外连通控制数˜ ()是图的最小外连通控制 集的基数. 我们构造了一类无限的2-连通3-正则图, 它有一条顶点数远小于图的顶点 数一半的最长路, 否定了由Akhbari, Hasni, Favaron, Karami, Sheikholeslami 提出的猜 测(J.Combin. Optim. (2011), DOI: 10.1007/s10878-011-9427-x). 关键词: 着色, 强直积,字典积,外连通控制数 – i – Abstract A -coloring of a graph is a proper vertex coloring such that each color class contains a vertex that has a neighbor in all other color classes. Any such vertex will be called a -vertex of color . The -chromatic number () is the largest integer such that admits a b-coloring with colors. In this thesis, we disprove two conjectures posed recently by Jakovac and Peterin (Studia Sci. Math. Hungar. 49(2012) 156-169)on the -chromatic number of strong product and lexicographic products of graphs. Let ( ) = min{ | there exists a graph on vertices with () = and girth at least }. We determine the exact value of ( ) for the case when ∈ {3 4 ∞}. A set of