Domination in functigraphs
From MaRDI portal
Publication:4647871
Abstract: Let and be disjoint copies of a graph , and let be a function. Then a emph{functigraph} has the vertex set and the edge set . A functigraph is a generalization of a emph{permutation graph} (also known as a emph{generalized prism}) in the sense of Chartrand and Harary. In this paper, we study domination in functigraphs. Let denote the domination number of . It is readily seen that . We investigate for graphs generally, and for cycles in great detail, the functions which achieve the upper and lower bounds, as well as the realization of the intermediate values.
Recommendations
- scientific article; zbMATH DE number 1124595
- Domination number of complements of functigraphs
- Dominating Functions and Graphs
- Domination in digraphs
- scientific article; zbMATH DE number 1270237
- scientific article; zbMATH DE number 6863591
- Domination in graphs
- scientific article; zbMATH DE number 1342030
- Domination in Graphs
- On Domination in Graphs
Cited in
(10)- On the distinguishing number of functigraphs
- On the fixing number of functigraphs
- Domination in the sense of diagrams
- DOMINIONS AND PRIMITIVE POSITIVE FUNCTIONS
- Domination number of complements of functigraphs
- On distance-\(s\) locating and distance-\(t\) dominating sets in graphs
- On the broadcast domination number of permutation graphs
- Locating-dominating sets of functigraphs
- On Roman domination number of functigraph and its complement
- Disjunctive total domination in permutation graphs
This page was built for publication: Domination in functigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4647871)