The numerical invariants concerning the total domination for generalized Petersen graphs
Summary: A subset \(S\) of \(V(G)\) is called a total dominating set of a graph \(G\) if every vertex in \(V(G)\) is adjacent to a vertex in \(S\). The total domination number of a graph \(G\) denoted by \(\gamma_t (G)\) is the minimum cardinality of a total dominating set in \(G\). The maximum order of a partition of \(V(G)\) into total dominating sets of \(G\) is called the total domatic number of \(G\) and is denoted by \(d_t (G)\). Domination in graphs has applications to several fields. Domination arises in facility location problems, where the number of facilities (e.g., hospitals and fire stations) is fixed, and one attempts to minimize the distance that a person needs to travel to get to the closest facility. In this paper, the numerical invariants concerning the total domination are studied for generalized Petersen graphs.
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- A note on the total domination number of a tree
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Dominating sets for split and bipartite graphs
- Graphs with large total domination number
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- On the multiplicative degree-based topological indices of silicon-carbon \(Si_2C_{3^-}I[p,q]\) and \(Si_{2}C_{3^-}II[p,q]\)
- On the total domatic number of regular graphs
- On the total domination number of Cartesian products of graphs
- Total domination in graphs
- Total domination in graphs
- Total domination number of grid graphs
- Which generalized petersen graphs are cayley graphs?
This page was built for publication: The numerical invariants concerning the total domination for generalized Petersen graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2221869)
