Domination Parameters in Hypertrees

被引：0

作者：

Jayagopal, R. ^{[1
]}

Rajasingh, Indra ^{[1
]}

Rajan, R. Sundara ^{[2
]}

机构：

[1] VIT Univ, Sch Adv Sci, Chennai 600127, Tamil Nadu, India

[2] Univ Newcastle, Sch Math & Phys Sci, Callaghan, NSW 2308, Australia

来源：

ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2016 | 2016年 / 9602卷

关键词：

Dominating set; Total dominating set; Locating-dominating set; Locating-total dominating set; Hypertree; IDENTIFYING CODES; SETS; GRAPHS; TREES;

D O I：

10.1007/978-3-319-29221-2_26

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A locating-dominating set (LDS) S of a graph G is a dominating set S of G such that for every two vertices u and v in V (G) \ S, N(u) boolean AND S not equal N(v) boolean AND S. The locating-domination number gamma(L)(G) is the minimum cardinality of a LDS of G. Further if S is a total dominating set then S is called a locating-total dominating set. In this paper we determine the domination, total domination, locating-domination and locating-total domination numbers for hypertrees.

引用

页码：299 / 307

页数：9

共 19 条

[1] [Anonymous], 2011, DISCUSS MATH, DOI DOI 10.7151/DMGT.1538
[2] [Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[3] [Anonymous], 1985, Graphs and Hypergraphs
[4] Charon I., 2006, THEORET COMPUT SCI, V290, P2109
[5] Identifying codes and locating-dominating sets on paths and cycles
Chen, Chunxia
Lu, Changhong
Miao, Zhengke
[J]. DISCRETE APPLIED MATHEMATICS, 2011, 159 (15) : 1540 - 1547
[6] Bounds on the locating-total domination number of a tree
Chen, Xue-gang
Sohn, Moo Young
[J]. DISCRETE APPLIED MATHEMATICS, 2011, 159 (08) : 769 - 773
[7] Cockayne E. J., 1977, Networks, V7, P247, DOI 10.1002/net.3230070305
[8] Exoo G., 2011, J COMBIN, V49, P177
[9] Locating and identifying codes in circulant networks
Ghebleh, M.
Niepel, L.
[J]. DISCRETE APPLIED MATHEMATICS, 2013, 161 (13-14) : 2001 - 2007
[10] GOODMAN JR, 1981, IEEE T COMPUT, V30, P923, DOI 10.1109/TC.1981.1675731

← 1 2 →