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: | , |
|---|---|
| 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 |
| id |
doaj-678709228c3145c9891da57475dccdfa |
|---|---|
| record_format |
Article |
| spelling |
doaj-678709228c3145c9891da57475dccdfa2020-11-25T00:16:46ZengUniversity of IsfahanTransactions on Combinatorics2251-86572251-86652012-09-01133946The common minimal dominating signed graphP. Siva ReddyB. PrashanthIn 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.http://www.combinatorics.ir/?_action=showPDF&article=1896&_ob=1e6fda2b7401644ed7d16a77256e20b5&fileName=full_text.pdfSigned graphsSwitchingBalanceCommon minimal dominating signed graphNeighborhood signed graph |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
P. Siva Reddy B. Prashanth |
| spellingShingle |
P. Siva Reddy B. Prashanth The common minimal dominating signed graph Transactions on Combinatorics Signed graphs Switching Balance Common minimal dominating signed graph Neighborhood signed graph |
| author_facet |
P. Siva Reddy B. Prashanth |
| author_sort |
P. Siva Reddy |
| title |
The common minimal dominating signed graph |
| title_short |
The common minimal dominating signed graph |
| title_full |
The common minimal dominating signed graph |
| title_fullStr |
The common minimal dominating signed graph |
| title_full_unstemmed |
The common minimal dominating signed graph |
| title_sort |
common minimal dominating signed graph |
| publisher |
University of Isfahan |
| series |
Transactions on Combinatorics |
| issn |
2251-8657 2251-8665 |
| publishDate |
2012-09-01 |
| description |
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. |
| topic |
Signed graphs Switching Balance Common minimal dominating signed graph Neighborhood signed graph |
| url |
http://www.combinatorics.ir/?_action=showPDF&article=1896&_ob=1e6fda2b7401644ed7d16a77256e20b5&fileName=full_text.pdf |
| work_keys_str_mv |
AT psivareddy thecommonminimaldominatingsignedgraph AT bprashanth thecommonminimaldominatingsignedgraph AT psivareddy commonminimaldominatingsignedgraph AT bprashanth commonminimaldominatingsignedgraph |
| _version_ |
1725382737296097280 |