X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (779) 779
Government Document (126) 126
Newspaper Article (103) 103
Magazine Article (48) 48
Book Chapter (37) 37
Conference Proceeding (22) 22
Dissertation (16) 16
Book Review (15) 15
Book / eBook (14) 14
Web Resource (7) 7
Reference (5) 5
Trade Publication Article (4) 4
Newsletter (1) 1
Paper (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics (174) 174
mathematics, applied (117) 117
domination (93) 93
graphs (89) 89
algorithms (77) 77
independent domination (65) 65
federal independent agencies (64) 64
independent set (64) 64
independent films (62) 62
computer science (57) 57
analysis (52) 52
competition (45) 45
independent study (45) 45
senate (45) 45
studies (45) 45
history (44) 44
independent domination number (43) 43
dominating set (42) 42
politics (42) 42
foreign relations (40) 40
education (38) 38
house of representatives (38) 38
independence (38) 38
independent sets (38) 38
combinatorics (37) 37
presidency of the u.s (37) 37
computer science, theory & methods (36) 36
domination number (36) 36
congress (35) 35
employment (35) 35
independent regulatory commissions (35) 35
research (35) 35
democracy (34) 34
graph theory (33) 33
independent variables (33) 33
labor (32) 32
number (32) 32
statistics (32) 32
taxation (32) 32
tree (32) 32
government spending (31) 31
independent bookstores (31) 31
veterans (31) 31
women (31) 31
budget of the u.s (30) 30
small business (30) 30
theory of computation (30) 30
economics (29) 29
elections (29) 29
federal employees (29) 29
statistics & probability (29) 29
economic policy (28) 28
independent grocery stores (28) 28
international relations (28) 28
optimization (28) 28
courts (27) 27
department of defense (27) 27
department of interior (27) 27
department of state (27) 27
department of treasury (27) 27
motion pictures (27) 27
russia (27) 27
california (26) 26
film-productions (26) 26
humans (26) 26
labor unions (26) 26
trees (26) 26
war (26) 26
agriculture (25) 25
federal departments and agencies (25) 25
federal-state relations (25) 25
labor law (25) 25
administrative law and procedure (24) 24
business (24) 24
commonwealth of independent states (24) 24
department of justice (24) 24
executive office of the president (24) 24
law (24) 24
motion picture industry (24) 24
05c69 (23) 23
aged and aging (23) 23
agricultural policies (23) 23
district of columbia (23) 23
government (23) 23
independent dominating set (23) 23
public administration (23) 23
security (23) 23
congressional committees (22) 22
department of agriculture (22) 22
feature films (22) 22
office of the vice president (22) 22
petroleum and petroleum industry (22) 22
republican party (22) 22
dramatic arts (21) 21
foreign countries (21) 21
housing (21) 21
independent contractors (21) 21
investments (21) 21
mathematics, general (21) 21
more...
Library Location Library Location
Library Location Library Location
X
Sort by Item Count (A-Z)
Filter by Count
Robarts - Stacks (4) 4
Collection Dvlpm't (Acquisitions) - Vendor file (3) 3
Law (Bora Laskin) - Stacks (1) 1
Regis College - Stacks (1) 1
St. Michael's College (John M. Kelly) - 2nd Floor (1) 1
Trinity College (John W Graham) - Stacks (1) 1
UofT at Mississauga - Stacks (1) 1
UofT at Scarborough - Stacks (1) 1
Victoria University E.J. Pratt - Stacks (1) 1
more...
Language Language
Language Language
X
Sort by Item Count (A-Z)
Filter by Count
English (1121) 1121
French (61) 61
Korean (4) 4
Portuguese (3) 3
Czech (2) 2
Afrikaans (1) 1
Chinese (1) 1
German (1) 1
Russian (1) 1
Slovenian (1) 1
Spanish (1) 1
Swedish (1) 1
more...
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Bulletin of the Malaysian Mathematical Sciences Society, ISSN 0126-6705, 3/2019, Volume 42, Issue 2, pp. 417 - 435
.... The weight of a $$t\mathrm{RDF}$$ t RDF g of a graph F is the value $$w(g) =\sum _{v \in V(F)}|g(v)|$$ w ( g ) = ∑ v ∈ V ( F ) | g ( v ) | . The independent t-rainbow domination number... 
05C76 | Independent rainbow domination | 05C85 | Domination number | Mathematics, general | Rainbow domination | Mathematics | NP-complete | Applications of Mathematics | 05C69 | 05C15 | MATHEMATICS
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 05/2015, Volume 35, Issue 2, pp. 283 - 300
Eternal and m-eternal domination are concerned with using mobile guards to protect a graph against infinite sequences of attacks at vertices... 
eternal dominating set | clique cover | dominating set | independent set | Independent set | Eternal dominating set | Dominating set | Clique cover | MATHEMATICS | GRAPHS
Journal Article
Theoretical computer science, ISSN 0304-3975, 11/2017, Volume 700, pp. 63 - 74
Weighted independent domination is an NP-hard graph problem, which remains computationally intractable in many restricted graph classes... 
Independent domination | Polynomial-time algorithm | SETS | FINITELY DEFINED CLASSES | COMPUTER SCIENCE, THEORY & METHODS | ALGORITHMS | GRAPHS
Journal Article
Journal of combinatorial optimization, ISSN 1573-2886, 2012, Volume 26, Issue 3, pp. 608 - 619
Journal Article
Discrete optimization, ISSN 1572-5286, 08/2017, Volume 25, pp. 1 - 5
The independent vertex–edge domination number and the upper non-enclaving number of a graph G are denoted by ive(G) and Ψ(G), respectively. Boutrig et al... 
Counterexample | Upper non-enclaving number | Independent vertex–edge domination number | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | Independent vertex edge domination number
Journal Article
Czechoslovak mathematical journal, ISSN 0011-4642, 06/2017, Volume 67, Issue 2, pp. 533 - 536
Let gamma(G) and i(G) be the domination number and the independent domination number of G, respectively... 
independent domination | domination | MATHEMATICS | Computer science
Journal Article
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 12/2014, Volume 178, pp. 157 - 159
We let γ(G) and i(G) denote the domination number and the independent domination number of G, respectively... 
Independent domination number | Maximum degree | Domination number | MATHEMATICS, APPLIED
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 3/2016, Volume 32, Issue 2, pp. 773 - 776
... $$S$$ S has a neighbor in $$S$$ S ; the domination number $$\gamma (G)$$ γ ( G ) is the minimum size of such a... 
Cubic graph | Domination number | Mathematics | Engineering Design | 3-regular | Combinatorics | Independent domination number | MATHEMATICS | REGULAR GRAPHS | Integers | Texts | Graphs | Combinatorial analysis
Journal Article
Bulletin of the Iranian Mathematical Society, ISSN 1735-8515, 2019, Volume 46, Issue 4, pp. 905 - 915
.... The weight of an IDRDF is the value Sigma(u is an element of V) f (u). The independent double Roman domination number i(dR)(G... 
MATHEMATICS | Graphs | Independent domination | Independent Roman {2}-domination | Independent double Roman domination
Journal Article
Journal of Applied Mathematics and Computing, ISSN 1598-5865, 10/2016, Volume 52, Issue 1, pp. 515 - 528
...$$ V - D is dominated by at least two vertices in D. The double domination number of G is the minimum fuzzy cardinality of all double domination set of G and is denoted by $$\gamma _{dd} (G)$$ γ d d ( G... 
03E72 | Computational Mathematics and Numerical Analysis | Mathematics | Theory of Computation | Isolated vertex | Domination | Cut node | Mathematics of Computing | Intuitionistic fuzzy graph | Appl.Mathematics/Computational Methods of Engineering | Double domination number | Independent set | Maximum and minimum degree | End node | Order and complement | 03F55 | Fuzzy logic | Studies | Graph theory | Mathematical analysis | Fuzzy sets | Parameters | Computation | Texts | Graphs | Mathematical models | Fuzzy
Journal Article
National Academy Science Letters, ISSN 0250-541X, 6/2015, Volume 38, Issue 3, pp. 263 - 269
We initiate the study of 2-outer-independent domination in graphs. A 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of $$V(G) {\setminus} D$$ V ( G... 
2-Outer-independent domination | Domination | History of Science | 2-Domination | Science, general | 2-DOMINATION NUMBER | BOUNDS | MULTIDISCIPLINARY SCIENCES
Journal Article
Bulletin of the Malaysian Mathematical Sciences Society, ISSN 0126-6705, 6/2016, Volume 39, Issue S1, pp. 205 - 218
... ) | . The 2-rainbow domination number $$\gamma _{r2}(G)$$ γ r 2 ( G ) (respectively, the independent 2-rainbow domination number $$i_{r2}(G)$$ i r 2 ( G... 
Mathematics, general | Tree | Mathematics | Strong equality | Applications of Mathematics | 05C69 | Independent 2-rainbow domination number | 2-Rainbow domination number | MATHEMATICS | RAINBOW DOMINATION | GRAPHS | Minimum weight | Trees | Mathematical functions | Trees (mathematics)
Journal Article
Discrete mathematics, algorithms, and applications, ISSN 1793-8309, 08/2018, Volume 10, Issue 4
Journal Article
Information processing letters, ISSN 0020-0190, 04/2020, Volume 156, p. 105914
•Polynomial-time algorithm for the weighted independent domination problem in P2... 
Weighted independent domination | NP-hardness | Independent domination | Algorithms | Polynomial-time | SETS | FINITELY DEFINED CLASSES | COMPUTER SCIENCE, INFORMATION SYSTEMS
Journal Article
Information processing letters, ISSN 0020-0190, 02/2015, Volume 115, Issue 2, pp. 256 - 262
.... The minimum weight efficient domination problem is the problem of finding an efficient dominating set of minimum weight in a given vertex-weighted graph... 
Efficient domination | Weighted efficient domination | AT-free graph | Graph algorithms | Dually chordal graph | PERFECT DOMINATION | COMPUTER SCIENCE, INFORMATION SYSTEMS | INDEPENDENT SETS | Computer science | Algorithms | Minimum weight | Reduction | Partitions | Weight reduction | Data processing | Graphs | Complexity | Computer Science - Discrete Mathematics
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 5/2017, Volume 33, Issue 4, pp. 1266 - 1275
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching, while the paired-domination number is the minimum cardinality of a paired-dominating... 
Domination | Regular graphs | Paired-domination number | Convex and Discrete Geometry | Claw-free graphs | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Operation Research/Decision Theory | Combinatorics | Optimization | Cubic graphs | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | BOUNDS | FREE CUBIC GRAPHS | MATCHINGS | INDEPENDENT SETS
Journal Article
Applied mathematics and computation, ISSN 0096-3003, 2020, Volume 364, p. 124617
...; and all vertices labeled by 0 is independent. The weight of an OIDRDF h is ∑w ∈ V(G)h(w), and the outer independent double Roman domination number γoidR(G... 
Double roman domination | Roman domination | Outer independent double roman domination | MATHEMATICS, APPLIED
Journal Article
No results were found for your search.

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