The [1,2]-set properties and algorithm analysis of tree

Chao Zhang; Tao Chen

doi:10.1117/12.3031908

8 June 2024 The [1,2]-set properties and algorithm analysis of tree

Chao Zhang, Tao Chen

Proceedings Volume 13171, Third International Conference on Algorithms, Microchips, and Network Applications (AMNA 2024); 131710O (2024) https://doi.org/10.1117/12.3031908
Event: 3rd International Conference on Algorithms, Microchips and Network Applications (AMNA 2024), 2024, Jinan, China

Abstract

A set S⊆V(G) in graph G is a [j, k]-set if it satisfies that G[S] is a subgraph of G and each vertex v∈V(G)∖S, has j≤∣N(v)∩S∣≤k, wherein j and k are nonnegative integers. In this paper, we focus on the situation of j=1, k=2, that is, [1,2]-set of graph G. We mainly study the situation of γ(T)-set and γ_[1,2](T)-set in tree, and analyse a particular tree called spider. Then discuss with two different algorithm to calculate the [1,2]-domination number γ_[1,2](T) in tree. Finally, compare and analyze the calculation results.

(2024) Published by SPIE. Downloading of the abstract is permitted for personal use only.

Citation Download Citation

Chao Zhang and Tao Chen "The [1,2]-set properties and algorithm analysis of tree", Proc. SPIE 13171, Third International Conference on Algorithms, Microchips, and Network Applications (AMNA 2024), 131710O (8 June 2024); https://doi.org/10.1117/12.3031908

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available