RO EN
Bounds on Global Total Domination in Graphs
Authors: Nader Jafari Rad, Elahe Sharifi
Keywords: Domination; Total domination; Global total domination.Domination; Total domination; Global total domination.
– 0.14 Mb
Keywords: Domination; Total domination; Global total domination.Domination; Total domination; Global total domination.
Abstract
A subset S of vertices in a graph G is aglobal total dominating set, or just GTDS, if $S$ is a total dominating set of both G and $\overline{G}$. The 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.Department of Mathematics,
Shahrood University of Technology,
Shahrood, Iran
E-mail: ,
Shahrood University of Technology,
Shahrood, Iran
E-mail: ,
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
Fulltext
– 0.14 Mb
Contents
- Bounds on Global Total Domination in Graphs
- Construction of a transitive orientation using B-stable subgraphs
- Maximum Inaccuracies of Second Order
- Measuring human emotions with modular neural networks and computer vision based applications
- Provably sender-deniable encryption scheme
- Modeling of meaning acquisition based on NL phrases using state transitions
- Identity, Ontology, and Frege's Problem
- Towards an Ontology of Individuals: Comments on "Identity, Ontology and Frege's Problem" of William Greenberg
