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

Our ability to understand and predict the response of ecosystems to a changing environment depends on quantifying vegetation functional diversity. However,...

General | Climate | Plant traits | Bayesian modeling | Global | Spatial statistics | PHOSPHORUS | MULTIDISCIPLINARY SCIENCES | global | climate | LEAF RESPIRATION | FORESTS | spatial statistics | MODELS | FUNCTIONAL TYPES | NITROGEN | PHOTOSYNTHETIC CAPACITY | DIVERSITY | plant traits | VEGETATION | Geography | Spatial Analysis | Quantitative Trait, Heritable | Ecosystem | Environment | Models, Statistical | Plants | Plant Dispersal | Physiological aspects | Environmental aspects | Models | Biological diversity | Environmental Sciences | ENVIRONMENTAL SCIENCES | global climate | 60 APPLIED LIFE SCIENCES | Biological Sciences | Physical Sciences | PNAS Plus

General | Climate | Plant traits | Bayesian modeling | Global | Spatial statistics | PHOSPHORUS | MULTIDISCIPLINARY SCIENCES | global | climate | LEAF RESPIRATION | FORESTS | spatial statistics | MODELS | FUNCTIONAL TYPES | NITROGEN | PHOTOSYNTHETIC CAPACITY | DIVERSITY | plant traits | VEGETATION | Geography | Spatial Analysis | Quantitative Trait, Heritable | Ecosystem | Environment | Models, Statistical | Plants | Plant Dispersal | Physiological aspects | Environmental aspects | Models | Biological diversity | Environmental Sciences | ENVIRONMENTAL SCIENCES | global climate | 60 APPLIED LIFE SCIENCES | Biological Sciences | Physical Sciences | PNAS Plus

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

控制数 | 顶点 | 产品 | 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

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

整数 | 形数 | 顶点集 | 诱导 | 路径数 | 子集 | 最小数 | 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

5.
Full Text
Equality in a bound that relates the size and the restrained domination number of a graph

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

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

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

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

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

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

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

[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

Domination | Bipartite | Edges | Extremal graph | Size | MATHEMATICS | NUMBER | domination | size | edges | bipartite | extremal graph

Journal Article

Global Ecology and Biogeography, ISSN 1466-822X, 2020, Volume 29, Issue 6, pp. 1034 - 1051

Aim Predictions of plant traits over space and time are increasingly used to improve our understanding of plant community responses to global environmental...

trait–environment relationships | trait model | wood density | environmental filtering | specific leaf area | intraspecific trait variation | plant height | leaf nitrogen concentration | ensemble forecasting | LEAF TRAITS | CLIMATE-CHANGE | SPATIAL-PATTERNS | VARIABILITY | trait-environment relationships | GEOGRAPHY, PHYSICAL | COMMUNITY | FUNCTIONAL TRAITS | SOIL | ECOLOGY | DIVERSITY | RANGE | Uncertainty | Divergence | Performance prediction | Plant communities | Environmental changes | Environmental factors | Plants | Nitrogen | Leaf area | Density | Planting density | Model accuracy | Leaves | Ecological effects | Polar environments | Predictions | Reliability analysis | Modelling | Plant reliability

trait–environment relationships | trait model | wood density | environmental filtering | specific leaf area | intraspecific trait variation | plant height | leaf nitrogen concentration | ensemble forecasting | LEAF TRAITS | CLIMATE-CHANGE | SPATIAL-PATTERNS | VARIABILITY | trait-environment relationships | GEOGRAPHY, PHYSICAL | COMMUNITY | FUNCTIONAL TRAITS | SOIL | ECOLOGY | DIVERSITY | RANGE | Uncertainty | Divergence | Performance prediction | Plant communities | Environmental changes | Environmental factors | Plants | Nitrogen | Leaf area | Density | Planting density | Model accuracy | Leaves | Ecological effects | Polar environments | Predictions | Reliability analysis | Modelling | Plant reliability

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 01/2017, Volume 217, p. 506

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

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

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

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

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

20.
Full Text
On equality in an upper bound for the restrained and total domination numbers of a graph

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

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.