笛卡尔乘积和直积图的全k控制划分数
On total k-domatic number of Cartesian and direct product of graphs
-
摘要: 给定正整数k, 不含孤立点的图G的全k控制函数(TkDF)是从顶点集V(G)到0,1,2,…,k的映射f使得对任意的v∈V(G), 与v相邻的点在f下的赋值之和至少为k.Abstract: For a positive integer k, the total k-dominating function (Tk DF) of a graph G without isolated vertices is a function f from the vertex set V(G) to
下载: