The common minimal dominating signed graph
In this paper, we define the common minimal dominating signedgraph of a given signed graph and offer a structuralcharacterization of common minimal dominating signed graphs. Inthe sequel, we also obtained switching equivalencecharacterizations: $overline{S} sim CMD(S)$ and $CMD(S) simN(S)$, where $o...
Main Authors: | P. Siva Reddy, B. Prashanth |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Isfahan
2012-09-01
|
Series: | Transactions on Combinatorics |
Subjects: | |
Online Access: | http://www.combinatorics.ir/?_action=showPDF&article=1896&_ob=1e6fda2b7401644ed7d16a77256e20b5&fileName=full_text.pdf |
Similar Items
-
The common minimal common neighborhood dominating signed graphs
by: Kavita S Permi, et al.
Published: (2013-03-01) -
Double domination in signed graphs
by: P.K. Ashraf, et al.
Published: (2016-12-01) -
A study on integer additive set-valuations of signed graphs
by: N.K. Sudev, et al.
Published: (2015-12-01) -
On the <i>A<sub>α</sub></i>-Eigenvalues of Signed Graphs
by: Germain Pastén, et al.
Published: (2021-08-01) -
Minimal, vertex minimal and commonality minimal CN-dominating graphs
by: Anwar Saleh Alwardi, et al.
Published: (2012-03-01)