Remote Monitoring by Edges and Faces of Maximal Outerplanar Graphs

被引：1

作者：

Hernandez, Gregorio ^{[1
]}

Martins, Mafalda ^{[2
]}

机构：

[1] Univ Politecn Madrid, Campus Montegancedo, E-28660 Madrid, Spain

[2] Univ Aveiro, CIDMA Ctr Res & Dev Math & Applicat, Dept Math, Campus Univ Santiago, P-3810193 Aveiro, Portugal

来源：

COMPUTER JOURNAL | 2017年 / 60卷 / 09期

关键词：

domination; covering; guarding; triangulation graphs; maximal outerplanar graphs; GUARDING POLYHEDRAL TERRAINS;

D O I：

10.1093/comjnl/bxw106

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

The concepts of monitoring the elements of triangulation graphs by edges and faces at a distance were defined by Hernandez and Martins (2014, Electr. Notes Discrete Math., 46, 145-152). Furthermore, for any n-vertex maximal outerplanar graph, they provide combinatorial bounds when k = 2. In this paper, we continue their study, generalizing its results to any value of k. We prove that on maximal outerplanar graphs.

引用

页码：1279 / 1288

页数：10

共 8 条

[1] Distance k-domination, distance k-guarding, and distance k-vertex cover of maximal outerplanar graphs [J].

Alvarado, Jose D. ;

Dantas, Simone ;

Rautenbach, Dieter .

DISCRETE APPLIED MATHEMATICS, 2015, 194 :154-159

[2] Guarding polyhedral terrains [J].

Bose, P ;

Shermer, T ;

Toussaint, G ;

Zhu, BH .

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1997, 7 (03) :173-185

[3]

Canales S., 2013, P 15 SPAN M COMP GEO, P51

[4] Edge guarding polyhedral terrains [J].

Everett, H ;

RiveraCampo, E .

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1997, 7 (03) :201-203

[5]

Haynes TW, 1998, Fundamentals of domination in graphs, V1st, DOI [DOI 10.1201/9781482246582, 10.1201/9781482246582]

[6]

Hernandez G., 2014, ELECT NOTES DISCRETE, V46, P145

[7] RELATIONS BETWEEN PACKING AND COVERING NUMBERS OF A TREE [J].

MEIR, A ;

MOON, JW .

PACIFIC JOURNAL OF MATHEMATICS, 1975, 61 (01) :225-233

[8]

SHERMER T, 1991, GEOMETRIAE DEDICATA, V37, P183

← 1 →