X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
semitotal domination (17) 17
mathematics (13) 13
domination (8) 8
graphs (8) 8
mathematics, applied (8) 8
graph theory (7) 7
05c69 (6) 6
combinatorics (6) 6
apexes (4) 4
total domination (4) 4
tree (4) 4
claw-free (3) 3
engineering design (3) 3
np-complete (3) 3
paired-domination (3) 3
sets (3) 3
apx-complete (2) 2
completeness (2) 2
computational complexity (2) 2
computer science, interdisciplinary applications (2) 2
computer science, theory & methods (2) 2
convex and discrete geometry (2) 2
cubic (2) 2
mathematical modeling and industrial mathematics (2) 2
operations research/decision theory (2) 2
optimization (2) 2
parameters (2) 2
perfect graphs (2) 2
roman domination (2) 2
semipaired domination number (2) 2
semitotal domination number (2) 2
set (2) 2
statistics & probability (2) 2
theory of computation (2) 2
trees (2) 2
upper bounds (2) 2
algorithms (1) 1
approximation algorithm (1) 1
bipartite graphs (1) 1
bounded mim-width (1) 1
cartesian products (1) 1
chordal graphs (1) 1
clique-width (1) 1
combinatorial analysis (1) 1
complexity (1) 1
computer science (1) 1
computer science, software engineering (1) 1
conjecture (1) 1
cubic graph (1) 1
dually chordal graphs (1) 1
educational software (1) 1
equal domination (1) 1
free cubic graphs (1) 1
graph (1) 1
graph algorithm (1) 1
hardness (1) 1
independent domination (1) 1
inequalities (1) 1
inequality (1) 1
information science (1) 1
interval graphs (1) 1
irredundance (1) 1
line graphs (1) 1
lower bounds (1) 1
matching (1) 1
mathematical analysis (1) 1
mathematical functions (1) 1
maximal outerplanar graphs (1) 1
regular graphs (1) 1
regularity (1) 1
semi-total domination number (1) 1
semipaired domination (1) 1
semitotal dominating set (1) 1
semitotal domination subdivision number (1) 1
stable graph (1) 1
texts (1) 1
theory (1) 1
total dominating set (1) 1
total domination number (1) 1
total roman domination (1) 1
unicyclic graph (1) 1
upper bound (1) 1
upper semitotal domination (1) 1
vertices (1) 1
weighting functions (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Discussiones Mathematicae. Graph Theory, ISSN 2083-5892, 2016, Volume 36, Issue 1, pp. 71 - 93
...; namely, the domination number, γ( ), and the total domination number, ). A set of vertices in a graph is a semitotal dominating set of if it is a dominating set of and every vertex in is within distance 2 of another vertex... 
semitotal domination | domination | 05C69 | trees | Domination | Trees | Semitotal domination | MATHEMATICS | GRAPHS
Journal Article
GRAPHS AND COMBINATORICS, ISSN 0911-0119, 05/2020, Volume 36, Issue 3, pp. 689 - 702
A set S of vertices in a graph G is a semitotal dominating set of G if it is a dominating set of G and every vertex in S is within distance 2 of another vertex... 
Trees | MATHEMATICS | Semitotal domination | Trees (mathematics) | Graph theory | Apexes
Journal Article
Graphs and combinatorics, ISSN 1435-5914, 2017, Volume 33, Issue 2, pp. 403 - 417
A set S of vertices in an isolate-free graph G is a semitotal dominating set of G if it is a dominating set of G and every vertex in S is within distance... 
Regular graphs | Mathematics | Engineering Design | Combinatorics | 05C69 | Upper semitotal domination | PERFECT GRAPHS | MATHEMATICS | IRREDUNDANCE | FREE CUBIC GRAPHS | Parameters | Upper bounds | Texts | Graphs | Graph theory | Regularity | Weighting functions | Combinatorial analysis
Journal Article
Theoretical computer science, ISSN 0304-3975, 2020, Volume 814, pp. 28 - 48
A semitotal dominating set of a graph G with no isolated vertex is a dominating set D of G such that every vertex in D is within distance two of another vertex in D. The minimum size γt2(G... 
Total Dominating Set | Dually chordal graphs | Bounded mim-width | Semitotal Dominating Set | Computational complexity | SET | COMPLEXITY | CLIQUE-WIDTH | TREE | COMPLETENESS | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Discrete mathematics, ISSN 0012-365X, 2014, Volume 324, Issue 1, pp. 13 - 18
...), and the total domination number, γt(G). A set S of vertices in G is a semitotal dominating set of G if it is a dominating set of G and every vertex in S is within distance... 
Domination | Matching | Total domination | Semitotal domination | MATHEMATICS | Mathematical analysis | Graphs
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2019, Volume 258, pp. 8 - 12
A set of vertices S in a simple isolate-free graph G is a semi-total dominating set of G if it is a dominating set of G and every vertex of S is within distance 2 of another vertex... 
Cartesian products | Total domination number | Semi-total domination number | MATHEMATICS, APPLIED | SEMITOTAL DOMINATION | Apexes | Graphs | Graph theory
Journal Article
Theoretical computer science, ISSN 0304-3975, 2019, Volume 766, pp. 46 - 57
For a graph G=(V,E), a set D⊆V is called a semitotal dominating set of G if D is a dominating set of G, and every vertex in D is within distance 2 of another vertex of D... 
Domination | Interval graphs | APX-complete | Semitotal domination | NP-complete | Approximation algorithm | Bipartite graphs | Chordal graphs | Graph algorithm | SET | COMPLETENESS | COMPUTER SCIENCE, THEORY & METHODS | HARDNESS | Algorithms
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 10/2019, Volume 38, Issue 3, pp. 911 - 926
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 7/2018, Volume 34, Issue 4, pp. 819 - 844
A subset S of vertices in a graph G is a dominating set if every vertex in $$V(G) {\setminus } S$$ V(G)\S is adjacent to a vertex... 
Paired-domination | Claw-free | Semipaired domination number | Mathematics | Engineering Design | Combinatorics | Cubic | 05C69 | MATHEMATICS | SEMITOTAL DOMINATION | SETS | VERTICES | CONJECTURE | Graph theory
Journal Article
Journal of combinatorial optimization, ISSN 1573-2886, 2018, Volume 36, Issue 2, pp. 416 - 433
Journal Article
Utilitas Mathematica, ISSN 0315-3681, 03/2018, Volume 106, pp. 165 - 184
...), and the total domination number, gamma(t)(G), of a graph G with no isolated vertex. A set S of vertices in G is a semitotal dominating set of G if S is a dominating set of G and every vertex in S is within distance 2 of another vertex... 
Domination | Total domination | Semitotal domination | MATHEMATICS, APPLIED | STATISTICS & PROBABILITY | SETS
Journal Article
Discrete mathematics and theoretical computer science, ISSN 1365-8050, 2018, Volume 20, Issue 2
...)$, and the total domination number, $\gamma_t(G)$. A set $S$ of vertices in $G$ is a semitotal dominating set of $G... 
Domination | Tree | Semitotal domination
Journal Article
Annals of combinatorics, ISSN 0219-3094, 2016, Volume 20, Issue 4, pp. 799 - 813
In this paper, we continue the study of semitotal domination in graphs in [Discrete Math. 324, 13–18 (2014)]. A set $${S}$$ S of vertices in $${G}$$ G is a semitotal dominating set... 
semitotal domination | cubic | claw-free | Mathematics | Combinatorics | 05C69 | total domination | MATHEMATICS, APPLIED
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2019, Volume 254, pp. 295 - 298
Given a graph G containing no isolated vertex, a set S⊆V(G) is said to be a semitotal dominating set of G if for every vertex in V(G... 
Line graphs | Upper bound | NP-complete | Semitotal domination number | MATHEMATICS, APPLIED | Graphs
Journal Article
Mathematics (Basel), ISSN 2227-7390, 2019, Volume 7, Issue 9, p. 820
A set S ⊆ V ( G ) in a graph G is a dominating set if every vertex of G is either in S or adjacent to a vertex... 
MATHEMATICS | unicyclic graph | SEMITOTAL DOMINATION | ROMAN DOMINATION | tree | independent domination | stable graph
Journal Article
by Zehui Shao and Pu Wu
Communications in combinatorics and optimization, ISSN 2538-2128, 01/2018, Volume 3, Issue 2, pp. 143 - 150
A set $S \subseteq V(G)$ is a semitotal dominating set of a graph $G$ if‎ ‎it is a dominating set of $G$ and‎ ‎every vertex... 
semitotal domination | NP-complete | APX-complete
Journal Article
Journal of discrete mathematical sciences & cryptography, ISSN 0972-0529, 07/2020, Volume 23, Issue 5, pp. 973 - 987
A set D of vertices in an isolate-free graph G is a semitotal dominating set of G if D is a dominating set of G and every vertex in D is within distance 2 of another vertex of D... 
Semitotal domination subdivision number | Computational complexity | Semitotal domination number
Journal Article
MATHEMATICS, ISSN 2227-7390, 03/2020, Volume 8, Issue 3, p. 349
Let G be a graph without isolated vertices. A function f:V(G)-> {0,1,2} is a total Roman dominating function on G if every vertex v is an element of V(G) for which f(v... 
MATHEMATICS | Roman domination | total Roman domination | semitotal domination | domination | Lower bounds | Theory | Apexes | Upper bounds | Graphs | Mathematical functions | Graph theory | Inequality | roman domination | total roman domination
Journal Article
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, ISSN 1462-7264, 2018, Volume 20, Issue 2
...), and the total domination number, gamma(t)(G). A set S of vertices in G is a semitotal dominating set of G if it is a dominating set of G and every vertex in S is within distance 2 of another vertex... 
COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS | MATHEMATICS, APPLIED | semitotal domination | domination | tree | EQUAL DOMINATION
Journal Article
Utilitas Mathematica, ISSN 0315-3681, 2014, Volume 94, pp. 67 - 81
.... We define a set S of vertices in a graph G with no isolated vertices to be a semitotal dominating set of G if it is a dominating set of G and every vertex in S is within distance 2 of another vertex... 
Domination | Graph | Total domination | Semitotal domination | MATHEMATICS, APPLIED | STATISTICS & PROBABILITY
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.