The Signed (|G|–1) subdomination number of Product Graphs
In this paper, the singed (|G | −1) - subdomination number of product graphs G, such as P2 × Pn, P2 ×Cn, P3 × Pn, are determined by classified discussion and exhaustived method.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2021-01-01
|
| Series: | MATEC Web of Conferences |
| Online Access: | https://www.matec-conferences.org/articles/matecconf/pdf/2021/05/matecconf_cscns20_08016.pdf |
| Summary: | In this paper, the singed (|G | −1) - subdomination number of product graphs G, such as P2 × Pn, P2 ×Cn, P3 × Pn, are determined by classified discussion and exhaustived method. |
|---|---|
| ISSN: | 2261-236X |