The upper domatic number of a graph

Teresa W. Haynes,Jason T. Hedetniemi,Stephen T. Hedetniemi,Alice McRae, Nicholas Phillips

AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS（2018）

引用 4|浏览21

暂无评分

摘要

Let G=(V,E) be a graph. For two disjoint sets of vertices R and S, set R dominates set S if every vertex in S is adjacent to at least one vertex in R. In this paper we introduce the upper domatic number D(G), which equals the maximum order k of a vertex partition π={V1,V2,…,Vk} such that for every i,j, 1≤i更多

查看译文

关键词

Domination,Domatic number,Upper domatic number,Transitivity

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要