Paper
4 August 2022 The signed domination number of generalized Sierpiński networks
Zhipeng Liang, Jinxia Yang
Author Affiliations +
Proceedings Volume 12306, Second International Conference on Digital Signal and Computer Communications (DSCC 2022); 123061S (2022) https://doi.org/10.1117/12.2641282
Event: Second International Conference on Digital Signal and Computer Communications (DSCC 2022), 2022, Changchun, China
Abstract
A signed dominating function of a graph G = (V, E) is a function f : V → {1,-1} satisfying the condition that for every vV with f(N[v]) ≥ 1.The weight of a signed dominating function on G is the sum f (V) = ∑vV f (v) and the signed dominating number, γs (G) is the minimum weight of a signed dominating function, and satisfying the condition γs (G) = f(V) said that makes the signed dominating function f is the graph of a minimum signed dominating function. In this paper, the methods of mathematical induction and classification discussion are mainly used to deeply investigate, we obtained the signed dominating number of the generalized Sierpiński networks, where G is any special class of graphs like Path Pn、Cycle Cn、Star K1,n、Complete graph Kn .
© (2022) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Zhipeng Liang and Jinxia Yang "The signed domination number of generalized Sierpiński networks", Proc. SPIE 12306, Second International Conference on Digital Signal and Computer Communications (DSCC 2022), 123061S (4 August 2022); https://doi.org/10.1117/12.2641282
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Silicon

Astatine

Stars

Back to Top