>
Fa   |   Ar   |   En
   THE COMMON MINIMAL COMMON NEIGHBORHOOD DOMINATING SIGNED GRAPHS  
   
نویسنده سیوا کوتا ردی پ. ,راجان ک. ر. ,پرمی کاویتا س.
منبع transactions on combinatorics - 2013 - دوره : 2 - شماره : 1 - صفحه:1 -8
چکیده    In this paper, we define the common minimal common neighborhood dominating signedgraph (or common minimal cn-dominating signed graph) of a given signed graph and offer a structuralcharacterization of common minimal cn-dominating signed graphs. in the sequel, we also obtainedswitching equivalence characterization:   cmcn(), where  and cmcn() are complementarysigned graph and common minimal cn-signed graph of  respectively.
کلیدواژه Signed graphs ,Balance ,Switching ,Complement ,Common minimal CN-dominating signed graph ,Negation
آدرس Acharya Institute of Technology Bangalore, Department of Mathematics, Acharya Institute of Technology Bangalore-560 090, India, India, Acharya Institute of Technology Bangalore, Department of Mathematics, Acharya Institute of Technology Bangalore-560 090, India, India, Acharya Institute of Technology Bangalore, Department of Mathematics, Acharya Institute of Technology Bangalore-560 090, India, India
پست الکترونیکی kavithapermi@acharya.ac.in
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved