bounds on global total domination in graphs

Clicks: 73
ID: 209389
2015
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #32 of 39 articles by views in integrative medicine research

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
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
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

No comments yet. Be the first to comment on this article.