X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (379) 379
Patent (37) 37
Book / eBook (15) 15
Publication (6) 6
Conference Proceeding (3) 3
Book Chapter (1) 1
Book Review (1) 1
Magazine Article (1) 1
Newspaper Article (1) 1
Paper (1) 1
Web Resource (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics (168) 168
mathematics, applied (65) 65
domination (57) 57
graphs (47) 47
discrete mathematics and combinatorics (45) 45
theoretical computer science (35) 35
multipartite tournaments (30) 30
edge-connectivity (24) 24
cycles (22) 22
05c69 (21) 21
electric communication technique (20) 20
electricity (20) 20
minimum degree (20) 20
digraph (18) 18
graph theory (17) 17
applied mathematics (16) 16
connectivity (15) 15
digraphs (15) 15
statistics & probability (15) 15
mathematics, general (14) 14
combinatorics (12) 12
mathematical analysis (12) 12
transmission (12) 12
degree sequence (11) 11
integers (11) 11
k-domination (11) 11
matching (11) 11
performing operations (11) 11
physics (11) 11
roman domination (11) 11
sufficient conditions (11) 11
transporting (11) 11
tree (11) 11
domination number (10) 10
physical or chemical processes or apparatus in general (10) 10
regular multipartite tournaments (10) 10
mathematical functions (9) 9
oriented graph (9) 9
bounds (8) 8
clique number (8) 8
complementary cycles (8) 8
critical (8) 8
regular graphs (8) 8
restricted edge-connectivity (8) 8
separation (8) 8
studies (8) 8
vertices (8) 8
analysis (7) 7
engineering design (7) 7
measuring (7) 7
measuring electric variables (7) 7
measuring magnetic variables (7) 7
testing (7) 7
05c20 (6) 6
almost regular multipartite tournaments (6) 6
broadcast communication (6) 6
combinatorial analysis (6) 6
computer science (6) 6
fault tolerance (6) 6
locally semicomplete digraphs (6) 6
minimum weight (6) 6
number (6) 6
numbers (6) 6
pictorial communication, e.g. television (6) 6
signed domatic number (6) 6
signed domination number (6) 6
super-edge-connectivity (6) 6
total domination (6) 6
trees (6) 6
upper bounds (6) 6
calculating (5) 5
computing (5) 5
counting (5) 5
cubic graphs (5) 5
degree sequence conditions (5) 5
directed-graphs (5) 5
equality (5) 5
extremal graphs (5) 5
female (5) 5
graph (5) 5
hamiltonian path (5) 5
history (5) 5
humans (5) 5
p-domination (5) 5
pancyclicity (5) 5
roman (5) 5
semicomplete multipartite digraphs (5) 5
signed dominating function (5) 5
signed k-dominating function (5) 5
signed k-domination number (5) 5
signed roman k-dominating function (5) 5
signed roman k-domination number (5) 5
size (5) 5
wireless communications networks (5) 5
2-domination (4) 4
2-domination number (4) 4
algebra (4) 4
computer science, information systems (4) 4
convex and discrete geometry (4) 4
diameter (4) 4
more...
Library Location Library Location
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, 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
Discrete Applied Mathematics, ISSN 0166-218X, 04/2019, Volume 258, pp. 235 - 241
A Roman{2}-dominating function of a graph G with vertex set V(G) is defined in Chellali et al. (2016) as a function f:V(G)→{0,1,2} having the property that if... 
Domination | Roman [formula omitted]-domination | Roman [formula omitted]-domatic number | Roman {2}-domatic number | Roman {2}-domination | MATHEMATICS, APPLIED | Graphs | Mathematical functions
Journal Article
Journal of Combinatorial Mathematics and Combinatorial Computing, ISSN 0835-3026, 02/2018, Volume 104, pp. 205 - 215
Journal Article
Journal of Combinatorial Mathematics and Combinatorial Computing, ISSN 0835-3026, 05/2018, Volume 105, pp. 105 - 116
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 2018
Journal Article
ISSN 2083-5892, 2017
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 10/2016, Volume 32, Issue 3, pp. 855 - 871
Journal Article
Australasian Journal of Combinatorics, ISSN 1034-4942, 2016, Volume 64, Issue 3, pp. 444 - 457
Journal Article
ISSN 1234-3099, 2017
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 12/2016, Volume 214, pp. 179 - 186
A signed total Roman dominating function on a graph G is a function f:V(G)⟶{−1,1,2} such that ∑u∈N(v)f(u)≥1 for every vertex v∈V(G), where N(v) is the... 
Signed total Roman domatic number | Signed total Roman domination number | Signed total Roman dominating function | MATHEMATICS, APPLIED
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 05/2019, Volume 39, Issue 2, pp. 567 - 573
Let be a connected graph with minimum degree and edge-connectivity . A graph is maximally edge-connected if = , and it is super-edgeconnected if every minimum... 
clique number | maximally edge-connected graphs | edge-connectivity | super-edge-connected graphs | 05C40 | MATHEMATICS
Journal Article
Acta Mathematica Sinica, English Series, ISSN 1439-8516, 12/2019, Volume 35, Issue 12, pp. 1861 - 1870
Let D be a finite and simple digraph with vertex set V(D). The minimum degree δ of a digraph D is defined as the minimum value of its out-degrees and its... 
edge-connectivity | 05C40 | Mathematics, general | Mathematics | super-edge-connected digraphs | maximally edge-connected digraphs | Digraphs | Economic aid | Graph theory
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 01/2015, Volume 180, pp. 150 - 157
Let k≥1 be an integer. A signed Romank-dominating function on a graph G is a function f:V(G)⟶{−1,1,2} such that ∑u∈N[v]f(u)≥k for every v∈V(G), where N[v] is... 
Signed Roman [formula omitted]-domination number | Signed Roman [formula omitted]-dominating function | Signed Roman [formula omitted]-domatic number | Signed Roman k-dominating function | Signed Roman k-domatic number | Signed Roman k-domination number | MATHEMATICS, APPLIED
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 11/2017, Volume 37, Issue 4, pp. 1027 - 1038
Let k ≥ 1 be an integer. A signed total Roman k-dominating function on a graph G is a function f : V (G) → {−1, 1, 2} such that Ʃ f(u) ≥ k for every v ∈ V (G),... 
signed total Roman k-domatic number | signed total Roman k-domination number | signed total Roman k-dominating function | Signed total Roman k-domatic number | Signed total Roman k-domination number | Signed total Roman k-dominating function | MATHEMATICS | DOMINATION
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 02/2017, Volume 37, Issue 1, pp. 261 - 272
Let be a finite and simple digraph with vertex set ( ). A signed total Roman dominating function (STRDF) on a digraph is a function : ( ) → {−1, 1, 2}... 
05C20 | signed total Roman dominating function | 05C69 | digraph | signed total Roman domination number | Digraph | Signed total Roman domination number | Signed total Roman dominating function | MATHEMATICS | GRAPHS
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
ISSN 2083-5892, 2015
Journal Article
Filomat, ISSN 0354-5180, 1/2014, Volume 28, Issue 10, pp. 2121 - 2130
Let 𝑘 ≥ 2 be an integer. A function 𝑓 : 𝑉(𝐷) → {-1,1} defined on the vertex set 𝑉(𝐷) of a digraph 𝐷 is a signed total 𝑘-independence function if ∑... 
Integers | Mathematical functions | Vertices
Journal Article
Australasian Journal of Combinatorics, ISSN 1034-4942, 10/2013, Volume 57, Issue 1, pp. 39 - 48
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 01/2016, Volume 32, Issue 1, pp. 175 - 190
Let k 1 k a[yen] 1 be an integer, and let G G be a finite and simple graph with vertex set V(G)... 
Signed Roman k-dominating function | Signed Roman k-domination number | Minimum weight | Graphs | Mathematical functions
Journal Article
No results were found for your search.

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