The geodetic-dominating number of comb product graphs

被引：1

作者：

Fahrudin, Dimas Agus ^{[1
]}

Saputro, Suhadi Wido ^{[1
]}

机构：

[1] Inst Teknol Bandung, Fac Math & Nat Sci, Combinatorial Math Res Grp, Jalan Ganesa 10, Bandung 40132, Indonesia

来源：

ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS | 2020年 / 8卷 / 02期

关键词：

comb product; domination number; geodetic-dominating number; geodetic number; ROMAN DOMINATION;

D O I：

10.5614/ejgta.2020.8.2.13

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A set of vertices S is called a geodetic-dominating set of G if every vertex outside S is adjacent to a vertex in S, and also is located inside a shortest path between two vertices in S. The geodetic-dominating number of G is the minimum cardinality of geodetic-dominating sets of G. In this paper, we determine an exact value of the geodetic-dominating number of comb product graphs of any connected graphs of order at least two.

引用

页码：373 / 381

页数：9

共 24 条

[1]

[Anonymous], 2018, STAT OPTIMIZATION IN

[2]

Azari M, 2013, MATCH-COMMUN MATH CO, V70, P901

[3]

Blidia M, 2007, AUSTRALAS J COMB, V39, P219

[4] On the geodetic number and related metric sets in Cartesian product graphs [J].