|
|
|
|
perfect secure domination in graphs
|
|
|
|
|
|
|
|
نویسنده
|
rashmi s.v. divya ,arumugam subramanian ,bhutani kiran r. ,gartland peter
|
|
منبع
|
categories and general algebraic structures with applications - 2017 - دوره : 7 - شماره : 1 - صفحه:125 -140
|
|
چکیده
|
Let g=(v,e) be a graph. a subset s of v is a dominating set of g if every vertex in v∖s is adjacent to a vertex in s. a dominating set s is called a secure dominating set if for each v∈v∖s there exists u∈s such that v is adjacent to u and s1=(s∖{u})∪{v} is a dominating set. if further the vertex u∈s is unique, then s is called a perfect secure dominating set. the minimum cardinality of a perfect secure dominating set of g is called the perfect secure domination number of g and is denoted by γps(g). in this paper we initiate a study of this parameter and present several basic results.
|
|
کلیدواژه
|
secure domination ,perfect secure domination ,secure domination number ,perfect secure domination number
|
|
آدرس
|
vidyavardhaka college of engineering, department of mathematics, india, kalasalingam university, national centre for advanced research in discrete mathematics, india, catholic university of america, department of mathematics, usa, catholic university of america, department of mathematics, usa
|
|
پست الکترونیکی
|
56gartland@cardinalmail.cua.edu
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|