MATEC Web Conf.
Volume 336, 20212020 2nd International Conference on Computer Science Communication and Network Security (CSCNS2020)
|Number of page(s)||8|
|Section||Network and Information Security|
|Published online||15 February 2021|
The Signed (|G|–1) subdomination number of Product Graphs
1 Sanda University, Shanghai, China
2 School of Mathematics, Physics and Statistics, Shanghai University of Engineering Science, Shanghai, China
* Corresponding author: email@example.com
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.
© The Authors, published by EDP Sciences, 2021
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.