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.

Bibliographic Details
Main Authors: Shi Wei, Wu Suichao
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
id doaj-b8f2933c22c64e1f81ce498342b49129
record_format Article
spelling doaj-b8f2933c22c64e1f81ce498342b491292021-02-18T10:45:31ZengEDP SciencesMATEC Web of Conferences2261-236X2021-01-013360801610.1051/matecconf/202133608016matecconf_cscns20_08016The Signed (|G|–1) subdomination number of Product GraphsShi Wei0Wu Suichao1Sanda UniversitySchool of Mathematics, Physics and Statistics, Shanghai University of Engineering ScienceIn 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.https://www.matec-conferences.org/articles/matecconf/pdf/2021/05/matecconf_cscns20_08016.pdf
collection DOAJ
language English
format Article
sources DOAJ
author Shi Wei
Wu Suichao
spellingShingle Shi Wei
Wu Suichao
The Signed (|G|–1) subdomination number of Product Graphs
MATEC Web of Conferences
author_facet Shi Wei
Wu Suichao
author_sort Shi Wei
title The Signed (|G|–1) subdomination number of Product Graphs
title_short The Signed (|G|–1) subdomination number of Product Graphs
title_full The Signed (|G|–1) subdomination number of Product Graphs
title_fullStr The Signed (|G|–1) subdomination number of Product Graphs
title_full_unstemmed The Signed (|G|–1) subdomination number of Product Graphs
title_sort signed (|g|–1) subdomination number of product graphs
publisher EDP Sciences
series MATEC Web of Conferences
issn 2261-236X
publishDate 2021-01-01
description 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.
url https://www.matec-conferences.org/articles/matecconf/pdf/2021/05/matecconf_cscns20_08016.pdf
work_keys_str_mv AT shiwei thesignedg1subdominationnumberofproductgraphs
AT wusuichao thesignedg1subdominationnumberofproductgraphs
AT shiwei signedg1subdominationnumberofproductgraphs
AT wusuichao signedg1subdominationnumberofproductgraphs
_version_ 1724263129590792192