Convex and Weakly Convex Domination in Prism Graphs

Discussiones Mathematicae Graph Theory

Rosicka Monika¹ 

[1] Faculty of Mathematics, Physics and Informatics, University of Gdańsk, 80–952 Gdańsk, Poland;

关键词: domination;    prism graphs;    05c69;   

DOI  :  10.7151/dmgt.2207

来源: DOAJ

【 摘 要 】

For a given graph G = (V;E) and permutation π : V ↦ V the prism πG of G is defined as follows: V (πG) = V (G) ∪ V (G′), where G′ is a copy of G, and E(πG) = E(G) ∪ E(G′) ∪Mπ, where Mπ = {uv′ : u ∈ V (G); v = π (u)} and v′ denotes the copy of v in G′.

【 授权许可】

Unknown