理学 >>> 数学 >>> 数理逻辑与数学基础 数论 代数学 代数几何学 几何学 拓扑学 数学分析 非标准分析 函数论 常微分方程 偏微分方程 动力系统 积分方程 泛函分析 计算数学 概率论 数理统计学 应用统计数学 运筹学 组合数学 离散数学 模糊数学 应用数学 数学其他学科
搜索结果: 1-8 共查到数学 domination相关记录8条 . 查询时间(0.057 秒)
Let $G=(V,E)$ be a graph and $p$ a positive integer. A subset $S\subseteq V$ is called a $p$-dominating set of $G$ if every vertex not in $S$ has at least $p$ neighbors in $S$. The $p$-domination numb...
A vertex coloring of a graph $G$ is an assignment of colors to the vertices of $G$ such that every two adjacent vertices of $G$ have different colors. A coloring related property of a graphs is also a...
A set $S$ of vertices of a graph $G$ is a dominating set in $G$ if every vertex outside of $S$ is adjacent to at least one vertex belonging to $S$. A domination parameter of $G$ is related to those se...
In this paper, we study the {k}-domination, total {k}-domination, {k}-domatic number, and total {k}-domatic number problems, from complexity and algorithmic points of view. Let k ∶ 1 be a fixed intege...
We consider two graph optimization problems called vector domination and total vector domination. In vector domination one seeks a small subset S of vertices of a graph such that any vertex outside S ...
Conditions are provided under which lack of domination of a homoclinic class yields robust heterodimensional cycles. Moreover, so-called viral homoclinic classes are studied. Viral classes have the p...
A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that is not adjacent to a vertex of degree one, the total domination number of G−v is less than the...
专著信息 书名 A note Nordhaus-Gaddum inequalities for domination 语种 英文 撰写或编译 作者 Erfang Shan,Chuangyin Dang,Liying Kang 第一作者单位 出版社 Discrete Applied Mathematics, Vol. 136, 83-85, 2004 出版地 出版日期 2004年 月 日 标准书号 ...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...