X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics (6) 6
05c69 (3) 3
roman domination (3) 3
secure domination (3) 3
trees (3) 3
analysis (2) 2
combinatorics (2) 2
convex and discrete geometry (2) 2
graph theory (2) 2
graphs (2) 2
mathematical functions (2) 2
mathematical modeling and industrial mathematics (2) 2
mathematics, general (2) 2
minimum weight (2) 2
roman-empire (2) 2
05c20 (1) 1
bondage number (1) 1
chains (1) 1
clique covering (1) 1
co-roman domination (1) 1
combinatorial analysis (1) 1
computer science (1) 1
computer science, interdisciplinary applications (1) 1
digraph (1) 1
discrete mathematics and combinatorics (1) 1
domination (1) 1
domination subdivision number (1) 1
edge-removal-critical graph (1) 1
engineering design (1) 1
er-critical graph (1) 1
eternal domination (1) 1
graph property (1) 1
induced-hereditary property (1) 1
inequalities (1) 1
irredundance (1) 1
mathematics, applied (1) 1
non-orientable genus (1) 1
operations research/decision theory (1) 1
optimization (1) 1
ordinary differential equations (1) 1
orientable genus (1) 1
oriented graph (1) 1
planar graphs (1) 1
protection (1) 1
protection of a graph (1) 1
roman (1) 1
roman bondage number (1) 1
roman independence (1) 1
roman irredundance (1) 1
roman parameters (1) 1
sharpness (1) 1
texts (1) 1
theoretical computer science (1) 1
theory of computation (1) 1
total domination (1) 1
tournament (1) 1
upper bounds (1) 1
weak roman domination (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Graphs and Combinatorics, ISSN 0911-0119, 1/2016, Volume 32, Issue 1, pp. 79 - 92
... Roman irredundance numbers, and then develop a Roman domination chain parallel to the well-known domination chain... 
Roman independence | Roman domination | Mathematics | Engineering Design | Combinatorics | Roman irredundance | Roman parameters | MATHEMATICS | Computer science | Minimum weight | Chains | Mathematical functions | Sharpness | Inequalities | Texts | Graphs | Roman | Combinatorial analysis
Journal Article
Ars combinatoria, ISSN 0381-7032, 10/2012, Volume 107, pp. 473 - 492
Eternal domination of a graph requires the vertices of the graph to be protected, against infinitely long sequences of attacks, by guards located at vertices,... 
Clique covering | Eternal domination | Total domination | MATHEMATICS | clique covering | ROMAN-EMPIRE | TREES | IRREDUNDANCE | SECURE DOMINATION | eternal domination | total domination
Journal Article
Discrete mathematics, ISSN 0012-365X, 2009, Volume 309, Issue 19, pp. 5820 - 5827
A secure dominating set X of a graph G is a dominating set with the property that each vertex u ∈ V G − X is adjacent to a vertex v ∈ X such that ( X − { v } )... 
ER-critical graph | Protection of a graph | Edge-removal-critical graph | Secure domination | MATHEMATICS | ROMAN-EMPIRE | TREES | PROTECTION
Journal Article
Czechoslovak Mathematical Journal, ISSN 0011-4642, 3/2013, Volume 63, Issue 1, pp. 191 - 204
For a graph property P and a graph G, we define the domination subdivision number with respect to the property P to be the minimum number of edges that must be... 
domination subdivision number | graph property | orientable genus | Mathematics | Roman bondage number | Ordinary Differential Equations | Analysis | Convex and Discrete Geometry | non-orientable genus | bondage number | Mathematics, general | Mathematical Modeling and Industrial Mathematics | 05C69 | induced-hereditary property | MATHEMATICS | PLANAR GRAPHS
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 10/2019, Volume 38, Issue 3, pp. 667 - 679
Let $$D=(V,A)$$ D = ( V , A ) be a digraph. A Roman dominating function of a digraph D is a function f : $$V\longrightarrow \{0,1,2\}$$ V ⟶ { 0 , 1 , 2 } such... 
05C20 | Oriented graph | Mathematics | Theory of Computation | Optimization | Convex and Discrete Geometry | Operations Research/Decision Theory | Roman domination | Mathematical Modeling and Industrial Mathematics | Combinatorics | Digraph | 05C69 | Tournament | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Journal Article
Proceedings - Mathematical Sciences, ISSN 0253-4142, 2/2015, Volume 125, Issue 1, pp. 1 - 10
Let G = (V,E) be a graph and let f : V → {0, 1, 2} be a function. A vertex u is said to be protected with respect to f if f(u) > 0 or f(u) = 0 and u is... 
Domination | Mathematics, general | Roman domination | weak Roman domination | Mathematics | co-Roman domination | 05C69 | Weak Roman domination | Co-Roman domination | MATHEMATICS | TREES | SECURE DOMINATION | Analysis | Graph theory
Journal Article
No results were found for your search.

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