Subdomination in Graphs with Upper-Bounded Vertex Degree

Subdomination in Graphs with Upper-Bounded Vertex Degree

We find a lower bound for the <i>k</i>-subdomination number on the set of graphs with a given upper bound for vertex degrees. We study the cases where the proposed lower bound is sharp, construct the optimal graphs and indicate the corresponding <i>k</i>-subdominating functio...

Full description

Bibliographic Details
Main Authors: Darya Lemtyuzhnikova, Pavel Chebotarev, Mikhail Goubko, Ilja Kudinov, Nikita Shushko
Format: Article
Language:English
Published: MDPI AG 2023-06-01
Series:Mathematics
Subjects:
two-tier voting
<i>k</i>-subdomination number
<i>k</i>-subdominating opinion function
graphs with bounded degree
social interaction
opinion leader
Online Access:https://www.mdpi.com/2227-7390/11/12/2722

Internet

https://www.mdpi.com/2227-7390/11/12/2722

Similar Items