Eternal m- Security Subdivision Numbers in Graphs

نویسنده

چکیده مقاله:

Let  be a simple graph with vertex set  and edges set . A set  is a dominating set if every vertex in  is adjacent to at least one vertex  in . An eternal 1-secure set of a graph G is defined as a dominating set  such that for any positive integer k and any sequence  of vertices, there exists a sequence of guards   with  and either  or  and  is a dominating set. If we take a guard on every vertex in an eternal 1-secure set, then for any sequence of attacks to vertices of the graph only by moving one guard during one of the edges adjacent with the vertex, the result set still remains secure. Now let for every sequence of attacks to vertices, all guards could move during one of the edges adjacent with the vertex and the result set still remains secure. This set is called eternal -  secure set. The eternal -  security number  is defined as the minimum number of an eternal - secure set. secure set in G. An edge  is subdivided if the edge  is deleted and a new vertex  is added, along with two new edges and . The eternal - security subdivision number  of a graph  is the minimum cardinality of a set of edges that must be subdivided (where each edge in  can be subdivided at most once) in order to increase the eternal - security number of  to increase the eternal m- security number of G. In this paper, we show that the eternal - security subdivision number is at most 3 for any nontrivial graph .  

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eternal m-security subdivision numbers in graphs

An eternal $m$-secure set of a graph $G = (V,E)$ is aset $S_0subseteq V$ that can defend against any sequence ofsingle-vertex attacks by means of multiple-guard shifts along theedges of $G$. A suitable placement of the guards is called aneternal $m$-secure set. The eternal $m$-security number$sigma_m(G)$ is the minimum cardinality among all eternal$m$-secure sets in $G$. An edge $uvin E(G)$ is ...

متن کامل

Mobile Eternal Security in Graphs

We consider the problem of securing a graph against a sequence of vertex attacks by placing guards on its vertices. The guards are “mobile” in that, after any attack, each guard can move to any neighbor of its current location, but one guard must move to the attacked vertex. We determine sharp upper bounds, in terms of the order of the graph, on the minimum number of guards necessary for connec...

متن کامل

Total domination subdivision numbers of graphs

A set S of vertices in a graph G = (V,E) is a total dominating set of G if every vertex of V is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set of G. The total domination subdivision number of G is the minimum number of edges that must be subdivided (where each edge in G can be subdivided at most once) in order to increase the tot...

متن کامل

Domination and independence subdivision numbers of graphs

The domination subdivision number sdγ(G) of a graph is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number. Arumugam showed that this number is at most three for any tree, and conjectured that the upper bound of three holds for any graph. Although we do not prove this interesting conjecture, we give an upp...

متن کامل

Total Roman domination subdivision number in graphs

A {em Roman dominating function} on a graph $G$ is a function $f:V(G)rightarrow {0,1,2}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$. A {em total Roman dominating function} is a Roman dominating function with the additional property that the subgraph of $G$ induced by the set of all vertices of positive weight has n...

متن کامل

On the total domination subdivision numbers in graphs

A set S of vertices of a graph G = (V ,E) without isolated vertex is a total dominating set if every vertex of V (G) is adjacent to some vertex in S. The total domination number γt (G) is the minimum cardinality of a total dominating set of G. The total domination subdivision number sdγt (G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) i...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 8  شماره 1

صفحات  0- 0

تاریخ انتشار 2022-03

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

کلمات کلیدی

کلمات کلیدی برای این مقاله ارائه نشده است

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023