|
|
|
|
THE COMMON MINIMAL DOMINATING SIGNED GRAPH
|
|
|
|
|
|
|
|
نویسنده
|
کوتا ردی پ. سیوا ,پراشانت پ.
|
|
منبع
|
transactions on combinatorics - 2012 - دوره : 1 - شماره : 3 - صفحه:39 -46
|
|
چکیده
|
Abstract. in this paper, we define the common minimal dominating signed graph of a given signedgraph and offer a structural characterization of common minimal dominating signed graphs. in thesequel, we also obtained switching equivalence characterizations: s cmd(s) and cmd(s) n(s),where s, cmd(s) and n(s) are complementary signed graph, common minimal signed graph andneighborhood signed graph of s respectively.
|
|
کلیدواژه
|
Signed graphs ,Balance ,Switching ,Complement ,Common minimal dominating signed graph ,Neighborhood signed ,Negation
|
|
آدرس
|
Acharya Institute of Technology Bangalore, India, Acharya Institute of Technology Bangalore, India
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|