Explicit construction of mixed dominating sets in generalized Petersen graphs

Meysam Rajaati Bavil Olyaei (), Mohsen Alambardar Meybodi (), Mohammad Reza Hooshmandasl () and Ali Shakiba ()
Additional contact information
Meysam Rajaati Bavil Olyaei: University of Garmsar
Mohsen Alambardar Meybodi: University of Isfahan
Mohammad Reza Hooshmandasl: University of Mohaghegh Ardabili
Ali Shakiba: University of New South Wales

Journal of Combinatorial Optimization, 2024, vol. 48, issue 4, No 2, 22 pages

Abstract: Abstract A mixed dominating set in a graph $$G=(V,E)$$ G = ( V , E ) is a subset D of vertices and edges of G such that every vertex and edge in $$(V\cup E)\setminus D$$ ( V ∪ E ) \ D is a neighbor of some elements in D. The mixed domination number of G, denoted by $$\gamma _{\textrm{md}}(G)$$ γ md ( G ) , is the minimum size among all mixed dominating sets of G. For natural numbers n and k, where $$n > 2k$$ n > 2 k , a generalized Petersen graph P(n, k) is a graph with vertices $$ \{v_0, v_1, \ldots , v_{n-1} \}\cup \{u_0, u_1, \ldots , u_{n-1}\}$$ { v 0 , v 1 , … , v n - 1 } ∪ { u 0 , u 1 , … , u n - 1 } and edges $$\cup _{0 \le i \le n-1} \{v_{i} v_{i+1}, v_iu_i, u_iu_{i+k}\}$$ ∪ 0 ≤ i ≤ n - 1 { v i v i + 1 , v i u i , u i u i + k } where subscripts are modulo n. In this paper, we explicitly construct an optimal mixed dominating set for generalized Petersen graphs P(n, k) for $$k \in \{1, 2\}$$ k ∈ { 1 , 2 } . Moreover, we establish some upper bound on mixed domination number for other generalized Petersen graphs.

Keywords: Petersen graph; Generalized Petersen graph; Dominating set; Mixed dominating set; 05C69; 05C85 (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-024-01222-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jcomop:v:48:y:2024:i:4:d:10.1007_s10878-024-01222-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-024-01222-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().