欢迎您!
东篱公司
退出
申报数据库
申报指南
立项数据库
成果数据库
期刊论文
会议论文
著 作
专 利
项目获奖数据库
位置:
成果数据库
>
期刊
> 期刊详情页
Bounds on the locating-total domination number of a tree
ISSN号:0166-218X
期刊名称:Discrete Applied Mathematics
时间:0
页码:769-773
相关项目:Hamilton圈分解和路分解的大集
作者:
Chen, Xue-Gang1|Sohn, Moo Young2|
同期刊论文项目
Hamilton圈分解和路分解的大集
期刊论文 15
同项目期刊论文
Completing the Spectrum of Resolvable (K-4 - e)-Designs
Large sets of P-3-decompositions of complete multipartite graphs
Incomplete group divisible designs with block size four and general index
基于对控制数与双控制数强相等的图
关于图的负k-子确定数的上界
Another product construction for large sets of resolvable directed triple systems
Large sets of oriented P_3-decompositions of directed complete bipartite graphs
Super-Simple Resolvable Balanced Incomplete Block Designs with Block Size 4 and Index 4
Large sets of lambda-fold K-1,K-3-factors of complete bipartite graphs
Large sets of K-2,K-2-decomposition of complete bipartite graphs
Large Sets of Hamilton Cycle and Path Decompositions of Complete Bipartite Graphs
Strong equality of domination parameters in graphs
夫妻围梯形桌入座问题