bounds on global total domination in graphs
Clicks: 2
ID: 209389
2015
Article Quality & Performance Metrics
Overall Quality
Improving Quality
0.0
/100
Combines engagement data with AI-assessed academic quality
Reader Engagement
Emerging Content
0.3
/100
1 views
1 readers
Trending
AI Quality Assessment
Not analyzed
Abstract
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.
| Reference Key |
rad2015computerbounds
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Nader Jafari Rad;Elahe Sharifi |
| Journal | integrative medicine research |
| Year | 2015 |
| DOI |
DOI not found
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.