Affiliation:
1. PG and Research Department of Mathematics, St. Xavier’s College, Palayamkottai, India
Abstract
A set of [Formula: see text] of vertices in a graph [Formula: see text] is called a dominating set if every vertex of [Formula: see text] is adjacent to an element of [Formula: see text]. Further, if [Formula: see text] has an isolated vertex, then [Formula: see text] is called an isolate dominating set. The minimum cardinality of an isolate dominating set of a graph [Formula: see text] is called the isolate domination number, denoted by [Formula: see text]. This paper examines the effects of removal of an edge on the isolate domination number of a graph.
Publisher
World Scientific Pub Co Pte Lt
Subject
Discrete Mathematics and Combinatorics
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Effects on fractional domination in graphs;Journal of Intelligent & Fuzzy Systems;2023-05-04
2. Edge-vertex domination on interval graphs;Discrete Mathematics, Algorithms and Applications;2023-03-28
3. Stability of (1,2)-total pitchfork domination;INT J NONLINEAR ANAL;2021
4. User social activity-based routing for cognitive radio networks;Personal and Ubiquitous Computing;2018-02-12