Share Your Research, Maximize Your Social Impacts
Signed Graph Equations: N(?) ? CMD(?); CMD(?) ? MD(?); MD(?) ? L(?)
Journal: Bulletin of the International Mathematical Virtual Institute (Vol.4, No. 1)Publication Date: 2014-11-27
Authors : P. Siva Kota Reddy; Kavita S Permi;
Page : 27-35
Keywords : Signed graphs; Balance; Switching; Complement; Common minimal dominating signed graph; Neighborhood signed graph; Minimal dominating signed graph; Line signed graph; Negation.;
Source : Download
Find it from : Google Scholar
Abstract
In this paper, we obtained the following switching equivalence characterizations: N() CMD(), CMD() MD() and MD() L(), where N(), CMD(), MD() and L() are neighborhood signed graph, common minimal signed graph, minimal dominating signed graph and line signed graph of complementary signed graph of respectively.
Other Latest Articles
- An upper bound to the second Hankel determinant for a subclass of avayitic functions
- Fokker?Planck Equation in n Dimensional Vector Space
- Weakly Ig-closed sets
- Hide and Encryption Fingerprint Image by using LSB and Transposition Pixel by Spiral Method?
- A Robust Key Pre-Distribution for Wireless Sensor Networks?
Last modified: 2015-01-09 18:54:21