Bounds on Global Total Domination in Graphs
A subset $S$ of vertices in a graph $G$ is a \textit{global total dominating set}, or just GTDS, if $S$ is a \textit{total dominating set} of both $G$ and $\overline{G}$. The \textit{global total domination number} $\gamma_{gt}(G)$ of $G$ is the minimum cardinality of a GTDS of $G$. We present b...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
2015-05-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v23-n1/v23-n1-(pp3-10).pdf.pdf |
| id |
doaj-dd7ebf8202b44af9b2c70045a0f281fe |
|---|---|
| record_format |
Article |
| spelling |
doaj-dd7ebf8202b44af9b2c70045a0f281fe2020-11-24T23:22:38ZengInstitute of Mathematics and Computer Science of the Academy of Sciences of MoldovaComputer Science Journal of Moldova1561-40422015-05-01231(67)310Bounds on Global Total Domination in GraphsNader Jafari Rad0Elahe Sharifi1Department of Mathematics, Shahrood University of Technology, Shahrood, IranDepartment of Mathematics, Shahrood University of Technology, Shahrood, IranA subset $S$ of vertices in a graph $G$ is a \textit{global total dominating set}, or just GTDS, if $S$ is a \textit{total dominating set} of both $G$ and $\overline{G}$. The \textit{global total domination number} $\gamma_{gt}(G)$ of $G$ is the minimum cardinality of a GTDS of $G$. We present bounds for the global total domination number in graphs.http://www.math.md/files/csjm/v23-n1/v23-n1-(pp3-10).pdf.pdfDominationTotal dominationGlobal total domination |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Nader Jafari Rad Elahe Sharifi |
| spellingShingle |
Nader Jafari Rad Elahe Sharifi Bounds on Global Total Domination in Graphs Computer Science Journal of Moldova Domination Total domination Global total domination |
| author_facet |
Nader Jafari Rad Elahe Sharifi |
| author_sort |
Nader Jafari Rad |
| title |
Bounds on Global Total Domination in Graphs |
| title_short |
Bounds on Global Total Domination in Graphs |
| title_full |
Bounds on Global Total Domination in Graphs |
| title_fullStr |
Bounds on Global Total Domination in Graphs |
| title_full_unstemmed |
Bounds on Global Total Domination in Graphs |
| title_sort |
bounds on global total domination in graphs |
| publisher |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova |
| series |
Computer Science Journal of Moldova |
| issn |
1561-4042 |
| publishDate |
2015-05-01 |
| description |
A subset $S$ of vertices in a graph $G$ is a \textit{global total
dominating set}, or just GTDS, if $S$ is a \textit{total
dominating set} of both $G$ and $\overline{G}$. The
\textit{global total domination number} $\gamma_{gt}(G)$ of $G$
is the minimum cardinality of a GTDS of $G$. We present bounds
for the global total domination number in graphs. |
| topic |
Domination Total domination Global total domination |
| url |
http://www.math.md/files/csjm/v23-n1/v23-n1-(pp3-10).pdf.pdf |
| work_keys_str_mv |
AT naderjafarirad boundsonglobaltotaldominationingraphs AT elahesharifi boundsonglobaltotaldominationingraphs |
| _version_ |
1725567131940028416 |