位置：成果数据库 > 期刊 > 期刊详情页
An upper bound on the restrained domination number of graphs
  • ISSN号：0381-7032
  • 期刊名称：Ars Combinatoria
  • 时间：0
  • 页码：383-389
  • 语言：英文
  • 相关项目：图的团横贯问题的算法和复杂性
作者： Gao, Mingjing|Shan, Erfang|
同期刊论文项目
图的团横贯问题的算法和复杂性
期刊论文 31
同项目期刊论文
Perfect matchings in paired domination vertex critical graphs
A note on the upper bound for the paired-domination number of a graph with minimum degree at least t
Total Restrained Domination in Cubic Graphs
弦图子类的全控制函数
Signed clique-transversal functions in graphs
Some matching properties in 4-gamma(x2)-critical graphs
Graphs with large total restrained domination number
Several domination numbers of a complete multipartite graph
Outer-connected domination in graphs
Matching properties in double domination edge critical graphs
On characterization of uniquely 3-list colorable complete multipartite graphs
Ordering of the trees by minimal energies
Inequality of Nordhaus{Gaddum Type for Total Outer-connected Domination in Graphs
Claw-free cubic graphs with clique-transversal number one-half their order
Clique-Transversal Sets in 4-Regular Claw-Free Graphs
Domination Number in Graphs with Minimum Degree Two
The twin domination number in generalized de Bruijn digraphs
Ordering of the trees with a perfect matching by minimal energies
Matching Properties in Total Domination Vertex Critical Graphs
Minus Edge Domination in Graphs
图的负边全控制数
Twin domination in generalized Kautz digraphs
Bounds on the absorbant number of generalized Kautz digraphs