>
Fa   |   Ar   |   En
   strong domination number of some operations on a graph  
   
نویسنده alikhani saeid ,ghanbari nima ,zaherifar hassan
منبع communications in combinatorics and optimization - 2024 - دوره : 9 - شماره : 4 - صفحه:773 -783
چکیده    Let $g=(v(g),e(g))$ be a simple graph. a set $dsubseteq v(g)$ is a strong dominating set of $g$, if for every vertex $xin v(g)setminus d$ there is a vertex $yin d$ with $xyin e(g)$ and $deg(x)leq deg(y)$. the strong domination number $gamma_{st}(g)$ is defined as the minimum cardinality of a strong dominating set.  in this paper, we examine the effects on $gamma_{st}(g)$ when $g$ is modified by operations on edge (or edges) of $g$.
کلیدواژه edge deletion ,edge subdivision ,edge contraction ,strong domination number
آدرس yazd university, department of mathematical sciences, iran, university of bergen, department of informatics, norway, yazd university, department of mathematical sciences, iran
پست الکترونیکی hzaherifar@gmail.com
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved