# On Mixed Domination in Generalized Petersen Graphs

Given a graph G = (V, E), a set S ⊆ V ∪ E of vertices and edges is called a mixed dominating set if every vertex and edge that is not included in S happens to be adjacent or incident to a member of S. The mixed domination number γ_md(G) of the graph is the size of the smallest mixed dominating set of G. We present an explicit method for constructing optimal mixed dominating sets in Petersen graphs P(n, k) for k ∈{1, 2}. Our method also provides a new upper bound for other Petersen graphs.

## Authors

• 1 publication
• 3 publications
• 2 publications
• 1 publication
• ### [1,2]-Domination in Generalized Petersen Graphs

A vertex subset S of a graph G=(V,E) is a [1,2]-dominating set if each v...
06/27/2019 ∙ by Fairouz Beggas, et al. ∙ 0

• ### Eternal domination on prisms of graphs

An eternal dominating set of a graph G is a set of vertices (or "guards"...
02/02/2019 ∙ by Aaron Krim-Yee, et al. ∙ 0

• ### Upper and Lower Bounds on Approximating Weighted Mixed Domination

A mixed dominating set of a graph G = (V, E) is a mixed set D of vertice...
06/26/2019 ∙ by Mingyu Xiao, et al. ∙ 0

• ### Generalized minimum dominating set and application in automatic text summarization

For a graph formed by vertices and weighted edges, a generalized minimum...
02/16/2016 ∙ by Yi-Zhi Xu, et al. ∙ 0

• ### Colourings of (m, n)-coloured mixed graphs

A mixed graph is, informally, an object obtained from a simple undirecte...
10/18/2020 ∙ by Gary MacGillivray, et al. ∙ 0

• ### Domination and location in twin-free digraphs

A dominating set D in a digraph is a set of vertices such that every ver...
10/11/2019 ∙ by Florent Foucaud, et al. ∙ 0