Title of article
THE COMMON MINIMAL COMMON NEIGHBORHOOD DOMINATING SIGNED GRAPHS
Author/Authors
سيوا كوتا ردي، پ. نويسنده Department of Mathematics, Acharya Institute of Technology Bangalore-560 090, India Siva Kota Reddy, P. , راجان، ك. ر. نويسنده Department of Mathematics, Acharya Institute of Technology Bangalore-560 090, India Rajanna, K. R. , پرمي، كاويتا س. نويسنده Department of Mathematics, Acharya Institute of Technology Bangalore-560 090, India Permi, Kavita S.
Issue Information
فصلنامه با شماره پیاپی 0 سال 2013
Pages
8
From page
1
To page
8
Abstract
In this paper, we define the common minimal common neighborhood dominating signed
graph (or common minimal CN-dominating signed graph) of a given signed graph and offer a structural
characterization of common minimal CN-dominating signed graphs. In the sequel, we also obtained
switching equivalence characterization: CMCN(), where and CMCN() are complementary
signed graph and common minimal CN-signed graph of respectively.
Journal title
Transactions on Combinatorics
Serial Year
2013
Journal title
Transactions on Combinatorics
Record number
842146
Link To Document