The common minimal dominating signed graph

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...

Full description

Bibliographic Details
Main Authors: P. Siva Reddy, B. Prashanth
Format: Article
Language:English
Published: University of Isfahan 2012-09-01
Series:Transactions on Combinatorics
Subjects:
Signed graphs
Switching
Balance
Common minimal dominating signed graph
Neighborhood signed graph
Online Access:http://www.combinatorics.ir/?_action=showPDF&article=1896&_ob=1e6fda2b7401644ed7d16a77256e20b5&fileName=full_text.pdf
Description
Summary: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 $overline{S}$, $CMD(S)$ and $N(S)$ are complementarysigned graph, common minimal signed graph and neighborhood signedgraph of $S$ respectively.
ISSN:2251-8657
2251-8665

Similar Items