Subdomination in Graphs with Upper-Bounded Vertex Degree

Darya Lemtyuzhnikova, Pavel Chebotarev, Mikhail Goubko (), Ilja Kudinov and Nikita Shushko
Additional contact information
Darya Lemtyuzhnikova: V.A. Trapeznikov Institute of Control Sciences of RAS, 117997 Moscow, Russia
Pavel Chebotarev: Technion—Israel Institute of Technology, Haifa 3200003, Israel
Mikhail Goubko: V.A. Trapeznikov Institute of Control Sciences of RAS, 117997 Moscow, Russia
Ilja Kudinov: V.A. Trapeznikov Institute of Control Sciences of RAS, 117997 Moscow, Russia
Nikita Shushko: V.A. Trapeznikov Institute of Control Sciences of RAS, 117997 Moscow, Russia

Mathematics, 2023, vol. 11, issue 12, 1-12

Abstract: We find a lower bound for the k -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 k -subdominating functions. The results are interpreted in terms of social structures.

Keywords: two-tier voting; k -subdomination number; k -subdominating opinion function; graphs with bounded degree; social interaction; opinion leader (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/12/2722/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/12/2722/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:12:p:2722-:d:1172083

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().