Journal of Combinatorial Optimization, ISSN 1382-6905, 8/2019, Volume 38, Issue 2, pp. 333 - 340

A subset S of vertices of a graph G without isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total...

Matching | Convex and Discrete Geometry | Operations Research/Decision Theory | Total domination number | Total domination subdivision number | Mathematics | Theory of Computation | Barrier | Mathematical Modeling and Industrial Mathematics | Combinatorics | Optimization | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Matching | Convex and Discrete Geometry | Operations Research/Decision Theory | Total domination number | Total domination subdivision number | Mathematics | Theory of Computation | Barrier | Mathematical Modeling and Industrial Mathematics | Combinatorics | Optimization | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Journal Article

Bulletin of the Malaysian Mathematical Sciences Society, ISSN 0126-6705, 2014, Volume 37, Issue 1, pp. 173 - 180

A set S subset of V of vertices in a graph G = (V, E) without isolated vertices is a total dominating set if every vertex of V is adjacent to some vertex in S....

Matching | Barrier | Total domination subdivisionnumber | Total domination number | TOTAL (K)-DOMINATION | MATHEMATICS | barrier | total domination number | TOTAL (K)-DOMATIC NUMBER | total domination subdivision number

Matching | Barrier | Total domination subdivisionnumber | Total domination number | TOTAL (K)-DOMINATION | MATHEMATICS | barrier | total domination number | TOTAL (K)-DOMATIC NUMBER | total domination subdivision number

Journal Article

Journal of Combinatorial Optimization, ISSN 1382-6905, 2/2011, Volume 21, Issue 2, pp. 209 - 218

The total domination subdivision number $\mathrm{sd}_{\gamma _{t}}(G)$ of a graph G is the minimum number of edges that must be subdivided (each edge in G can...

Operations Research/Decision Theory | Convex and Discrete Geometry | Total domination number | Total domination subdivision number | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Combinatorics | Optimization | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Operations Research/Decision Theory | Convex and Discrete Geometry | Total domination number | Total domination subdivision number | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Combinatorics | Optimization | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Journal Article

Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 05/2015, Volume 35, Issue 2, pp. 315 - 327

The domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be...

(total) domination subdivision number | (total) domination multisubdivision number | trees | (total) domination | Trees | MATHEMATICS | SUBDIVISION NUMBERS

(total) domination subdivision number | (total) domination multisubdivision number | trees | (total) domination | Trees | MATHEMATICS | SUBDIVISION NUMBERS

Journal Article

5.
Full Text
Results on Total Restrained Domination number and subdivision number for certain graphs

Journal of Discrete Mathematical Sciences and Cryptography, ISSN 0972-0529, 07/2015, Volume 18, Issue 4, pp. 363 - 369

In this paper we determine the total restrained domination number and subdivision number for andrásfai graph, chvatal graph, wheel graph, windmill graph and...

total restrained domination number | 05C69 | subdivision number | Total restrained dominating set

total restrained domination number | 05C69 | subdivision number | Total restrained dominating set

Journal Article

Ars Combinatoria, ISSN 0381-7032, 10/2011, Volume 102, pp. 321 - 331

A set S of vertices of a graph G = (V, E) without isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total...

Total domination number | Total domination subdivision number | MATHEMATICS | total domination number | total domination subdivision number

Total domination number | Total domination subdivision number | MATHEMATICS | total domination number | total domination subdivision number

Journal Article

Journal of Combinatorial Optimization, ISSN 1382-6905, 1/2013, Volume 25, Issue 1, pp. 91 - 98

A set S of vertices of a graph G=(V,E) without isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total...

Matching | Convex and Discrete Geometry | Operations Research/Decision Theory | Total domination number | Total domination subdivision number | Mathematics | Theory of Computation | Barrier | Mathematical Modeling and Industrial Mathematics | Combinatorics | Optimization | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Matching | Convex and Discrete Geometry | Operations Research/Decision Theory | Total domination number | Total domination subdivision number | Mathematics | Theory of Computation | Barrier | Mathematical Modeling and Industrial Mathematics | Combinatorics | Optimization | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Journal Article

Discrete Mathematics, ISSN 0012-365X, 2008, Volume 308, Issue 17, pp. 4018 - 4023

A set S of vertices of a graph G = ( V , E ) with no isolated vertex is a total dominating set if every vertex of V ( G ) is adjacent to some vertex in S. The...

Nordhaus–Gaddum inequalities | Total domination number | Total domination subdivision number | Nordhaus-Gaddum inequalities | MATHEMATICS | total domination number | total domination subdivision number

Nordhaus–Gaddum inequalities | Total domination number | Total domination subdivision number | Nordhaus-Gaddum inequalities | MATHEMATICS | total domination number | total domination subdivision number

Journal Article

Discrete Mathematics, ISSN 0012-365X, 2004, Volume 286, Issue 3, pp. 195 - 202

A set S of vertices in a graph G is a total dominating set of G if every vertex is adjacent to a vertex in S. The total domination number γ t ( G ) is the...

Trees | Total domination number | Total domination subdivision number | MATHEMATICS | total domination number | trees | total domination subdivision number

Trees | Total domination number | Total domination subdivision number | MATHEMATICS | total domination number | trees | total domination subdivision number

Journal Article

Graphs and Combinatorics, ISSN 0911-0119, 5/2009, Volume 25, Issue 1, pp. 41 - 47

A set S of vertices of a graph G = (V, E) without isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total...

Mathematics | Engineering Design | Combinatorics | Total domination number | Total domination subdivision number | MATHEMATICS

Mathematics | Engineering Design | Combinatorics | Total domination number | Total domination subdivision number | MATHEMATICS

Journal Article

Bulletin of the Iranian Mathematical Society, ISSN 1018-6301, 06/2016, Volume 42, Issue 3, pp. 499 - 506

Journal Article

Journal of Combinatorial Optimization, ISSN 1382-6905, 7/2010, Volume 20, Issue 1, pp. 76 - 84

A set S of vertices of a graph G=(V,E) without isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total...

Operations Research/Decision Theory | Convex and Discrete Geometry | Total domination number | Total domination subdivision number | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Combinatorics | Optimization | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Operations Research/Decision Theory | Convex and Discrete Geometry | Total domination number | Total domination subdivision number | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Combinatorics | Optimization | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Journal Article

Central European Journal of Mathematics, ISSN 1895-1074, 06/2010, Volume 8, Issue 3, pp. 468 - 473

A set S of vertices of a graph G = (V; E) without isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total...

Total domination number | Total domination subdivision number | MATHEMATICS

Total domination number | Total domination subdivision number | MATHEMATICS

Journal Article

Graphs and Combinatorics, ISSN 0911-0119, 11/2009, Volume 25, Issue 5, pp. 727 - 733

A set S of vertices of a graph G = (V, E) without isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total...

Mathematics | Engineering Design | Combinatorics | Total domination number | Total domination subdivision number | MATHEMATICS

Mathematics | Engineering Design | Combinatorics | Total domination number | Total domination subdivision number | MATHEMATICS

Journal Article

Ars Combinatoria, ISSN 0381-7032, 01/2010, Volume 94, pp. 431 - 443

In this paper we consider the effect of edge contraction on the domination number and total domination number of a graph. We define the (total) domination...

Domination | Domination contraction number | Total domination | MATHEMATICS | SUBDIVISION NUMBERS | domination contraction number | total domination

Domination | Domination contraction number | Total domination | MATHEMATICS | SUBDIVISION NUMBERS | domination contraction number | total domination

Journal Article

Discussiones Mathematicae - Graph Theory, ISSN 1234-3099, 2010, Volume 30, Issue 4, pp. 611 - 618

Journal Article

BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, ISSN 1735-8515, 06/2016, Volume 42, Issue 3, pp. 499 - 506

Let G = (V(G), E(G)) be a graph, gamma(t)(G). Let ooir(G) be the total domination and OO-irredundance number of G, respectively. A total dominating set S of G...

MATHEMATICS | irredundance number | Total domination number | total subdivision number | DOMINATION

MATHEMATICS | irredundance number | Total domination number | total subdivision number | DOMINATION

Journal Article

AKCE International Journal of Graphs and Combinatorics, ISSN 0972-8600, 08/2016, Volume 13, Issue 2, pp. 140 - 145

In this paper we give tight upper bounds on the total domination number, the weakly connected domination number and the connected domination number of a graph...

(Total) restrained/Roman bondage number | Total/(weakly) connected domination number | Orientable/nonorientable genus | Euler characteristic

(Total) restrained/Roman bondage number | Total/(weakly) connected domination number | Orientable/nonorientable genus | Euler characteristic

Journal Article

Opuscula Mathematica, ISSN 1232-9274, 01/2004, Volume 24, Issue 2, pp. 231 - 234

Let \(G=(V,E)\) be a graph. A subset \(D\subseteq V\) is a total dominating set of \(G\) if for every vertex \(y\in V\) there is a vertex \(x\in D\) with...

the strong domination number | subdivision | the total domination number

the strong domination number | subdivision | the total domination number

Journal Article

Graphs and Combinatorics, ISSN 0911-0119, 1/2012, Volume 28, Issue 1, pp. 1 - 55

In 1985, Fink and Jacobson gave a generalization of the concepts of domination and independence in graphs. For a positive integer k, a subset S of vertices in...

k -Tuple domination | l -Total k -domination | Connected k -domination | k -Independence | k -Irredundance | Mathematics | k -Star-forming | Engineering Design | Combinatorics | k -Domination | 05C69 | l-Total k-domination | k-Domination | k-Star-forming | k-Irredundance | Connected k-domination | k-Independence | k-Tuple domination | P-DOMINATION | F-DOMINATION | IRREDUNDANCE | EQUAL DOMINATION | TRANSVERSAL NUMBERS | CONJECTURE | MATHEMATICS | TREES | BOUNDS | 2-DOMINATION NUMBER | TUPLE DOMINATION | Graphs | Star & galaxy formation | Integers | Combinatorial analysis

k -Tuple domination | l -Total k -domination | Connected k -domination | k -Independence | k -Irredundance | Mathematics | k -Star-forming | Engineering Design | Combinatorics | k -Domination | 05C69 | l-Total k-domination | k-Domination | k-Star-forming | k-Irredundance | Connected k-domination | k-Independence | k-Tuple domination | P-DOMINATION | F-DOMINATION | IRREDUNDANCE | EQUAL DOMINATION | TRANSVERSAL NUMBERS | CONJECTURE | MATHEMATICS | TREES | BOUNDS | 2-DOMINATION NUMBER | TUPLE DOMINATION | Graphs | Star & galaxy formation | Integers | Combinatorial analysis

Journal Article

No results were found for your search.

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