欢迎您!
东篱公司
退出
申报数据库
申报指南
立项数据库
成果数据库
期刊论文
会议论文
著 作
专 利
项目获奖数据库
位置:
成果数据库
>
期刊
> 期刊详情页
Upper bounds on the upper signed total domination number of graphs
时间:0
相关项目:图的p-中心、控制集及核的理论与算法
同期刊论文项目
图的p-中心、控制集及核的理论与算法
期刊论文 23
同项目期刊论文
Total minus domination in k-partite graphs
Acyclic domination on bipartite permutation graphs
The p-maxian problem on block graphs
A polynomial-time algorithm for the paired-domination problem on permutation graphs
Total restrained domination in claw-free graphs
The exact domination number of the generalized Petersen graphs
An application of the Turan theorem to domination in graphs
Power domination in block graphs
Bounds on the clique-transversal number of regular graphs
具有特殊工件的平行机在线排序问题
Twin domination in generalized Kautz digraphs
Bounds on the absorbant number of generalized Kautz digraphs
图上Nordhaus-Gaddum型的符号全控制数的界
图的全控制数和匹配数的可比较性
Power domination in planar graphs with small diameter
Clique-transversal number of graphs whose clique-graphs are trees
Minus total κ-subdomination in graphs
Dominating functions with integer values in graphs a survey
块图中的团横贯集和团独立集
(k, l)-kernels in line digraphs
连通图生成树的叶子数
Signed total domination in nearly regular graphs