On a Variant Szeged and PI Indices of Thorn Graphs

2014 ◽  
pp. 279-298 ◽  
Keyword(s):  
2019 ◽  
Vol 13 (04) ◽  
pp. 2050071
Author(s):  
Derya Doğan Durgun ◽  
Berna Lökçü

Let [Formula: see text] be a graph and [Formula: see text] A dominating set [Formula: see text] is a set of vertices such that each vertex of [Formula: see text] is either in [Formula: see text] or has at least one neighbor in [Formula: see text]. The minimum cardinality of such a set is called the domination number of [Formula: see text], [Formula: see text] [Formula: see text] strongly dominates [Formula: see text] and [Formula: see text] weakly dominates [Formula: see text] if (i) [Formula: see text] and (ii) [Formula: see text] A set [Formula: see text] is a strong-dominating set, shortly sd-set, (weak-dominating set, shortly wd-set) of [Formula: see text] if every vertex in [Formula: see text] is strongly (weakly) dominated by at least one vertex in [Formula: see text]. The strong (weak) domination number [Formula: see text] of [Formula: see text] is the minimum cardinality of an sd-set (wd-set). In this paper, we present weak and strong domination numbers of thorn graphs.


2009 ◽  
Vol 23 (12) ◽  
pp. 600-604 ◽  
Author(s):  
Bo Zhou ◽  
Damir Vukičević
Keyword(s):  

2004 ◽  
Vol 81 (3) ◽  
pp. 299-311 ◽  
Author(s):  
Alpay Kirlangiç ◽  
Aysun Ozan Aytaç†
Keyword(s):  

2009 ◽  
Vol 309 (10) ◽  
pp. 3431-3435 ◽  
Author(s):  
Zhiping Wang ◽  
Yutang Zou ◽  
Haiying Liu ◽  
Zhongtuo Wang
Keyword(s):  

2016 ◽  
Vol 39 (6) ◽  
pp. 455-460
Author(s):  
Mahdieh Azari ◽  
Ali Iranmanesh
Keyword(s):  

2020 ◽  
Vol 8 (3) ◽  
pp. 1206-1212
Author(s):  
Shiladhar Pawar ◽  
Soner N. D.

2018 ◽  
Vol 162 (1) ◽  
pp. 1-15
Author(s):  
Chavdar Dangalchev
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document