>
Fa   |   Ar   |   En
   secure monophonic domination number of subdivision of graphs  
   
نویسنده sunitha k. ,divya d. josephine
منبع journal of hyperstructures - 2024 - دوره : 13 - شماره : 2 - صفحه:247 -256
چکیده    Let g = (v, e) be a connected graph. a monophonic dominating set m is said to be a secure monophonic dominating set sm (abbreviated as smd set) of g if for each v∈v m there exists u∈m such that v is adjacent to u and sm = {m (u)} ∪{v} is a monophonic dominating set. the minimum cardinality of a secure monophonic dominating set of g is the secure monophonic domination number of g and is denoted by γsm(g). in this paper, we investigate the secure monophonic domination number of subdivision of graphs such as subdivision of path graph s(pn), subdivision of cycle graph s(cn), subdivision of star graph s(k1,n-1), subdivision bistar graph s(bm,n) and subdivision of y-tree graph s(yn+1).
کلیدواژه monophonic path ,monophonic domination number ,secure monophonic domination number
آدرس scott christian college(autonomous), department of mathematics, india, manonmaniam sundaranar university, scott christian college(autonomous), department of mathematics, india
پست الکترونیکی divyajosephine1999@gmail.com
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved