X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics (77) 77
k-domination (57) 57
mathematics, applied (51) 51
graphs (35) 35
domination (31) 31
05c69 (22) 22
k-domination number (18) 18
[formula omitted]-domination (16) 16
graph theory (16) 16
mathematical analysis (15) 15
signed k-dominating function (15) 15
integers (14) 14
k-tuple domination (13) 13
signed k-domination number (13) 13
combinatorics (12) 12
domination number (12) 12
algorithms (11) 11
digraph (11) 11
bounds (10) 10
number (10) 10
total k-domination (10) 10
upper bounds (10) 10
discrete mathematics and combinatorics (9) 9
mathematics, general (9) 9
total domination (9) 9
analysis (8) 8
computer science (8) 8
signed total k-dominating function (8) 8
signed total k-domination number (8) 8
-domination number (7) 7
computer science, interdisciplinary applications (7) 7
convex and discrete geometry (7) 7
k -domination (7) 7
mathematical modeling and industrial mathematics (7) 7
optimization (7) 7
05c20 (6) 6
cartesian product (6) 6
computer science, theory & methods (6) 6
directed graph (6) 6
mathematical functions (6) 6
regular graphs (6) 6
signed roman k-dominating function (6) 6
signed roman k-domination number (6) 6
statistics & probability (6) 6
theory of computation (6) 6
-domination (5) 5
[formula omitted]-tuple domination (5) 5
k)-domatic number (5) 5
minimum weight (5) 5
theoretical computer science (5) 5
trees (5) 5
{k}-domination number (5) 5
2-domination (4) 4
2-domination number (4) 4
[formula omitted]-domination number (4) 4
algorithm (4) 4
applied mathematics. quantitative methods (4) 4
computer science, information systems (4) 4
connected k-domination (4) 4
discrete mathematics (4) 4
domatic number (4) 4
double domination (4) 4
graph (4) 4
hardness (4) 4
k-dominating set (4) 4
mathematical models (4) 4
numbers (4) 4
operations research/decision theory (4) 4
roman (4) 4
roman domination (4) 4
roman domination number (4) 4
roman k-domination number (4) 4
sets (4) 4
signed-domatic number (4) 4
total [formula omitted]-domination (4) 4
total domination number (4) 4
total {k}-domatic number (4) 4
total {k}-dominating function (4) 4
total {k}-domination number (4) 4
alpha-domination (3) 3
apexes (3) 3
applications of mathematics (3) 3
applied mathematics (3) 3
cartesian products (3) 3
combinatorial analysis (3) 3
computational complexity (3) 3
connected domination (3) 3
connected k-domination number (3) 3
directed-graphs (3) 3
distance-k domination (3) 3
dominating set (3) 3
domination numbers (3) 3
engineering design (3) 3
equal domination (3) 3
equitable domination (3) 3
free graphs (3) 3
hexagonal grid (3) 3
independence (3) 3
independent set (3) 3
k -domination number (3) 3
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Journal Article
Discrete mathematics, ISSN 0012-365X, 11/2015, Volume 338, Issue 11, pp. 2095 - 2104
We consider two general frameworks for multiple domination, which are called 〈r,s〉-domination and parametric domination. They generalise and unify... 
Threshold functions | Total [formula omitted]-domination | Upper bounds | [formula omitted]-domination | Parametric domination | [formula omitted]-tuple domination | k-domination | k-tuple domination | { k } -domination | (r, s) -domination | Total k-domination | MATHEMATICS | NUMBER | < r, s >-domination | BOUNDS | k}-domination | GRAPHS
Journal Article
Theoretical computer science, ISSN 0304-3975, 11/2019, Volume 795, pp. 128 - 141
Given a positive integer k, a k-dominating set in a graph G is a set of vertices such that every vertex not in the set has at least k neighbors in the set. A... 
k-domination | Polynomial-time algorithm | Proper interval graph | Total k-domination | COMPLEXITY | SETS | EFFICIENT ALGORITHMS | TUPLE TOTAL DOMINATION | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 02/2020, Volume 40, Issue 1, pp. 209 - 225
In this paper we introduce and study a new graph invariant derived from the degree sequence of a graph , called the and denoted sub ). This invariant serves as... 
Slater number | sub | domination number | degree sequence index strategy | 05C69 | MATHEMATICS | BOUNDS | sub-k-domination number | k-domination number | slater number | 05c69
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 2/2014, Volume 27, Issue 2, pp. 292 - 301
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 02/2018, Volume 38, Issue 1, pp. 301 - 317
Let = ( ) be a graph; a set ⊆ is a total -dominating set if every vertex ∈ has at least neighbors in . The total -domination number ) is the minimum... 
total | domination | 05C69 | tuple total domination | tuple domination | K-tuple total domination | K-tuple domination | K-domination | Total k-domination | k-domination | MATHEMATICS | k-tuple total domination | total k-domination | k-tuple domination
Journal Article
Bulletin of the Malaysian Mathematical Sciences Society, ISSN 0126-6705, 9/2019, Volume 42, Issue 5, pp. 1907 - 1920
Let D be a finite and simple digraph with vertex set V(D). A double Roman dominating function (DRDF) on a digraph D is a function $$f:V(D)\rightarrow... 
05C20 | Nordhaus–Gaddum | Signed domination | Double Roman domination | Mathematics, general | Roman domination | Mathematics | Applications of Mathematics | Digraph | 05C69 | k -domination | k-domination | MATHEMATICS | NUMBERS | Nordhaus-Gaddum | Minimum weight | Mathematical functions | Graph theory
Journal Article
Journal of Applied Mathematics and Computing, ISSN 1598-5865, 2/2018, Volume 56, Issue 1, pp. 73 - 91
Journal Article
Journal of inequalities and applications, ISSN 1029-242X, 2018, Volume 2018, Issue 1, pp. 1 - 17
Let G = ( V ( G ) , E ( G ) ) $G=(V(G),E(G))$ be a graph. A set D ⊆ V ( G ) $D\subseteq V(G)$ is a distance k-dominating set of G if for every vertex u ∈ V ( G... 
first Zagreb index | distance k -domination number | Analysis | Mathematics, general | second Zagreb index | Mathematics | Applications of Mathematics | 05C69 | 05C35 | trees | distance k-domination number | MATHEMATICS, APPLIED | ENERGY | SHARP BOUNDS | SUM | TOPOLOGICAL DESCRIPTOR | MATHEMATICS | UPPER-BOUNDS | MOLECULAR-ORBITALS | WIENER INDEX | COVERING NUMBERS | UNICYCLIC GRAPHS | BIPARTITE GRAPHS | Research
Journal Article
Journal of Combinatorial Mathematics and Combinatorial Computing, ISSN 0835-3026, 2016, Volume 98, pp. 343 - 349
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 5/2016, Volume 32, Issue 3, pp. 1217 - 1227
Let $$k\ge 1$$ k ≥ 1 be an integer, and let D be a finite and simple digraph with vertex set V(D). A signed Roman k-dominating function (SRkDF) on a digraph D... 
Signed Roman k -domination number | 05C20 | Mathematics | Engineering Design | Combinatorics | Digraph | Signed Roman k -dominating function | 05C69 | Signed Roman k-dominating function | Signed Roman k-domination number | Integers | Minimum weight | Mathematical analysis | Texts | Graphs | Roman | Graph theory | Combinatorial analysis
Journal Article
Computers & operations research, ISSN 0305-0548, 2018, Volume 96, pp. 69 - 79
•New approach to place charging stations for electric vehicles in road networks.•Computing reachability graphs for road networks and finding multiple... 
Electric vehicles | k-Domination | Road networks | Facility location problem | Heuristic optimization | α-Domination | DESIGN | alpha-Domination | GRAPHS | UPPER-BOUNDS | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | INFRASTRUCTURE | ENGINEERING, INDUSTRIAL
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 2/2017, Volume 33, Issue 2, pp. 365 - 372
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 02/2019, Volume 39, Issue 1, pp. 67 - 79
Let k be a positive integer. A signed Roman k-dominating function (SRkDF) on a digraph D is a function f : V (D) → {−1, 1, 2} satisfying the conditions that... 
05C20 | signed Roman k-domination number | signed Roman k-dominating function | 05C69 | digraph | oriented tree | Signed Roman k-domination number | Signed Roman k-dominating function | Digraph | Oriented tree | MATHEMATICS
Journal Article
Aequationes mathematicae, ISSN 0001-9054, 4/2016, Volume 90, Issue 2, pp. 271 - 279
Let G be a graph with vertex set V(G). For any integer k ≥ 1, a signed total k-dominating function is a function f: V(G) → {−1, 1} satisfying ∑ x∈N(v) f(x) ≥ k... 
Mathematics | Combinatorics | 05C69 | Signed total k -dominating function | signed total k -domination number | Analysis | Signed total k-dominating function | signed total k-domination number | MATHEMATICS | MATHEMATICS, APPLIED | Lower bounds | Mathematical functions | Functions (mathematics) | Integers | Graphs | Mathematical analysis
Journal Article
AKCE International Journal of Graphs and Combinatorics, ISSN 0972-8600, 04/2016, Volume 13, Issue 1, pp. 31 - 37
Efficiency and reliability are two important criteria in the designing of a good interconnection network. Network topological notions such as wide diameter,... 
Wide diameter | Diameter vulnerability | [formula omitted]-domination | Fault diameter | Mycielskian | domination | (l, k)-domination | (l,k)-domination
Journal Article
Filomat, ISSN 0354-5180, 2017, Volume 31, Issue 12, pp. 3925 - 3944
We prove the following result: If G be a connected graph on n >= 6 vertices, then there exists a set of vertices D with vertical bar D vertical bar <= n/3 and... 
Domination | Independent set | Isolation | CONNECTED DOMINATION | MATHEMATICS | MATHEMATICS, APPLIED | domination | K-DOMINATION | BOUNDS | SETS | isolation | independent set
Journal Article
Journal of the Korean Mathematical Society, ISSN 0304-9914, 2009, Volume 46, Issue 6, pp. 1309 - 1318
Let k be a positive integer, and let G be a simple graph with vertex set V(G). A Roman k-dominating function on G is a function f : V(G) -> {0, 1, 2} such that... 
Domination | Roman domination | Kdomination | Roman k-domination | k-domination | MATHEMATICS | MATHEMATICS, APPLIED | domination
Journal Article
Discrete mathematics, ISSN 0012-365X, 2017, Volume 340, Issue 3, pp. 494 - 503
As a natural variant of domination in graphs, Dankelmann et al. (2009) introduce exponential domination, where vertices are considered to have some dominating... 
Domination | Exponential domination | MATHEMATICS | K-DOMINATION | DISTANCE DOMINATION | BROADCASTS | Computer Science | Discrete Mathematics
Journal Article
Theoretical computer science, ISSN 0304-3975, 08/2017, Volume 689, pp. 27 - 35
We consider an iterative irreversible process on graphs. Starting with some initial set S of vertices of a given graph G, this process iteratively adds to S... 
Target set | Dynamic monopoly | Irreversible threshold processes | IRREVERSIBLE CONVERSION | DYNAMIC MONOPOLIES | K-DOMINATION NUMBER | APPROXIMABILITY | PERCOLATION | COMPUTER SCIENCE, THEORY & METHODS | Hardness | Management science | Algorithms
Journal Article
No results were found for your search.

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