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 sequ...
Main Author: | Maryam Atapour |
---|---|
Format: | Article |
Language: | fas |
Published: |
Kharazmi University
2022-03-01
|
Series: | پژوهشهای ریاضی |
Subjects: | |
Online Access: | http://mmr.khu.ac.ir/article-1-3022-en.html |
Similar Items
-
Eternal m-security subdivision numbers in trees
by: M. Atapour
Published: (2019-06-01) -
Eternal m-Security Bondage Numbers in Graphs
by: Aram Hamideh, et al.
Published: (2018-11-01) -
The Fruitless Branch and the Eternal Security of the Believer
by: Anthony Yaw Badu, et al.
Published: (2022-02-01) -
How Generic Is Eternal Inflation?
by: Ross Greenwood, et al.
Published: (2022-05-01) -
Domination, Eternal Domination, and Clique Covering
by: Klostermeyer William F., et al.
Published: (2015-05-01)