X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics (35) 35
mathematics, applied (18) 18
domination (15) 15
graphs (12) 12
trees (12) 12
discrete mathematics and combinatorics (11) 11
restrained domination (11) 11
theoretical computer science (9) 9
statistics & probability (7) 7
combinatorics (5) 5
graph (5) 5
total domination (5) 5
computer science, interdisciplinary applications (4) 4
nordhaus-gaddum (4) 4
optimization (4) 4
upper bound (4) 4
applied mathematics (3) 3
convex and discrete geometry (3) 3
excellent trees (3) 3
mathematical modeling and industrial mathematics (3) 3
mathematical models (3) 3
nitrogen (3) 3
operations research/decision theory (3) 3
parameters (3) 3
studies (3) 3
theory of computation (3) 3
total (3) 3
05c69 (2) 2
bayesian modeling (2) 2
bipartite graph (2) 2
climate (2) 2
diversity (2) 2
engineering design (2) 2
environmental changes (2) 2
global (2) 2
graph theory (2) 2
induced path number (2) 2
leaf area (2) 2
leaves (2) 2
mathematical analysis (2) 2
mathematics, general (2) 2
modelling (2) 2
models (2) 2
number (2) 2
numbers (2) 2
order of a graph (2) 2
outerplanar graph (2) 2
phosphorus (2) 2
planar graphs (2) 2
plant traits (2) 2
plants (2) 2
ramsey (2) 2
restrained (2) 2
sets (2) 2
size (2) 2
spatial statistics (2) 2
total restrained domination (2) 2
unicyclic graph (2) 2
variability (2) 2
vegetation (2) 2
weakly connected domination (2) 2
05c15 (1) 1
60 applied life sciences (1) 1
[formula omitted]-labelings (1) 1
[formula omitted]-minimal trees (1) 1
[sde]environmental sciences (1) 1
advanced placement programs (1) 1
algebra (1) 1
analysis (1) 1
authentic learning (1) 1
authentizität (1) 1
bayesian analysis (1) 1
biodiversity (1) 1
biodiversity and ecology (1) 1
biodiversité et ecologie (1) 1
biological diversity (1) 1
biological sciences (1) 1
bipartite (1) 1
bistar (1) 1
blades (1) 1
bondage number (1) 1
bounds (1) 1
cells (1) 1
changement climatique (1) 1
channel assignment (1) 1
claw-free graph (1) 1
climate-change (1) 1
college bound students (1) 1
college freshmen (1) 1
college mathematics (1) 1
color (1) 1
colour (1) 1
colouring (1) 1
combinatorial analysis (1) 1
community (1) 1
complement (1) 1
compressive properties (1) 1
compressor blades (1) 1
computer science (1) 1
computer science, general (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Proceedings of the National Academy of Sciences of the United States of America, ISSN 0027-8424, 12/2017, Volume 114, Issue 51, pp. E10937 - E10946
Journal Article
数学学报:英文版, ISSN 1439-8516, 2014, Volume 30, Issue 3, pp. 445 - 452
Let G=(V,E) be a graph.A set S■V is a restrained dominating set if every vertex in V-S is adjacent to a vertex in S and to a vertex in V-S.The restrained... 
控制数 | 顶点 | 产品 | VS | 基数 | 控制集 | Graph | domination | Nordhaus-Gaddum | Mathematics, general | upper bound | Mathematics | 05C69 | restrained domination | MATHEMATICS | MATHEMATICS, APPLIED | TREES
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 9/2014, Volume 30, Issue 5, pp. 1175 - 1181
For bipartite graphs G 1, G 2, . . . ,G k , the bipartite Ramsey number b(G 1, G 2, . . . , G k ) is the least positive integer b so that any colouring of the... 
Mathematics | Engineering Design | Bipartite graph | Bistar | Combinatorics | Ramsey | MATHEMATICS | Graph theory | Trees | Reproduction | Color | Texts | Graphs | Colouring | Combinatorial analysis | Colour
Journal Article
数学学报:英文版, ISSN 1439-8516, 2012, Volume 28, Issue 12, pp. 2365 - 2372
The induced path number p(G) of a graph G is defined as the minimum number of subsets into which the vertex set of G can be partitioned so that each subset... 
整数 | 形数 | 顶点集 | 诱导 | 路径数 | 子集 | 最小数 | Mathematics, general | Mathematics | induced path number | Nordhaus-Gaddum | 05C15 | MATHEMATICS | MATHEMATICS, APPLIED | Studies | Mathematical analysis | Graph theory | Integers | Lower bounds | Graphs | Complement | Upper bounds
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 5/2016, Volume 31, Issue 4, pp. 1586 - 1608
Let $$G=(V,E)$$ G = ( V , E ) be a graph. A set $$S\subseteq V$$ S ⊆ V is a restrained dominating set if every vertex in $$V-S$$ V - S is adjacent to a vertex... 
Domination | Order | Graph | Convex and Discrete Geometry | Size | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Operation Research/Decision Theory | Combinatorics | Restrained domination | Optimization | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | MAXIMUM SIZES | PARAMETERS
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 11/2009, Volume 25, Issue 5, pp. 693 - 706
Let G = (V, E) be a graph. A set $${S\subseteq V}$$ is a restrained dominating set if every vertex in V − S is adjacent to a vertex in S and to a vertex in V −... 
Domination | Order of a graph | Upper bound | Graph | Claw-free graph | Mathematics | Engineering Design | Combinatorics | Restrained domination | MATHEMATICS | TREES | NUMBERS
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 8/2011, Volume 22, Issue 2, pp. 166 - 179
Let G=(V,E) be a graph. A set S⊆V is a restrained dominating set if every vertex in V−S is adjacent to a vertex in S and to a vertex in V−S. The restrained... 
Lower bound | Cubic graph | Mathematics | Theory of Computation | Restrained domination | Optimization | Domination | Upper bound | Graph | Convex and Discrete Geometry | Operations Research/Decision Theory | Mathematical Modeling and Industrial Mathematics | Combinatorics | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | TREES | NUMBERS
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2008, Volume 308, Issue 23, pp. 5446 - 5453
Let G = ( V , E ) be a graph. A set S ⊆ V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V − S . The... 
Restrained domination | Bondage number | Restrained bondage | MATHEMATICS | NUMBER | TREES | DOMINATION
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2009, Volume 157, Issue 13, pp. 2846 - 2858
Let G = ( V , E ) be a graph. A set S ⊆ V is a restrained dominating set if every vertex in V − S is adjacent to a vertex in S and to a vertex in V − S . The... 
Domination | Order of a graph | Upper bound | Graph | Minimum degree | Restrained domination | MATHEMATICS, APPLIED | TREES | EQUALITY
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2008, Volume 308, Issue 7, pp. 1080 - 1087
Let G = ( V , E ) be a graph. A set S ⊆ V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V - S is... 
Domination | Nordhaus–Gaddum | Restrained | Total | Nordhaus-Gaddum | MATHEMATICS | restrained | total | domination
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2009, Volume 309, Issue 8, pp. 2340 - 2348
An L ( j , k ) -labeling of a graph G , where j ≥ k , is defined as a function f : V ( G ) → Z + ∪ { 0 } such that if u and v are adjacent vertices in G , then... 
[formula omitted]-minimal trees | Channel assignment | [formula omitted]-labelings | Distance two labeling | L (d, 1)-labelings | L (2, 1)-labelings | λ-minimal trees
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2004, Volume 281, Issue 1, pp. 137 - 148
We find the maximum number of edges for a graph of given order and value of parameter for several domination parameters. In particular, we consider the total... 
Domination | Bipartite | Edges | Extremal graph | Size | MATHEMATICS | NUMBER | domination | size | edges | bipartite | extremal graph
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 01/2017, Volume 217, p. 506
We show that the total domination number of a maximal outerplanar graph G is bounded above by ..., where n is the order of G and k is the number of vertices of... 
Studies | Graphs
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2009, Volume 157, Issue 14, pp. 3086 - 3093
Let G = ( V , E ) be a connected graph. A dominating set S of G is a weakly connected dominating set of G if the subgraph ( V , E ∩ ( S × V ) ) of G with... 
Weakly connected domination | Total domination | Bounds | Matching number | MATHEMATICS, APPLIED | GRAPHS
Journal Article
Australasian Journal of Combinatorics, ISSN 1034-4942, 2004, Volume 29, pp. 143 - 156
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2007, Volume 307, Issue 13, pp. 1643 - 1650
Let G = ( V , E ) be a graph. A set S ⊆ V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V - S is... 
Trees | Total restrained domination | MATHEMATICS | total restrained domination | trees
Journal Article
Ars Combinatoria, ISSN 0381-7032, 01/2010, Volume 94, pp. 477 - 483
Let G = (V, E) be a graph. A set S subset of V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V - S.... 
MATHEMATICS
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 10/2012, Volume 24, Issue 3, pp. 329 - 338
The induced path number ρ(G) of a graph G is defined as the minimum number of subsets into which the vertex set of G can be partitioned so that each subset... 
Operations Research/Decision Theory | Convex and Discrete Geometry | Nordhaus-Gaddum | Induced path number | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Combinatorics | Optimization | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | GRAPHS
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2007, Volume 307, Issue 22, pp. 2845 - 2852
Let G = ( V , E ) be a graph. A set S ⊆ V is a restrained dominating set (RDS) if every vertex not in S is adjacent to a vertex in S and to a vertex in V ⧹ S .... 
Restrained domination | Total domination | MATHEMATICS | TREES | PARAMETERS | restrained domination | total domination
Journal Article
No results were found for your search.

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