X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics, applied (10) 10
mathematics (7) 7
graphs (6) 6
mathematical functions (6) 6
roman domination (6) 6
minimum weight (5) 5
graph theory (4) 4
domination (3) 3
double roman domination (3) 3
geodetic number (3) 3
geodetic set (3) 3
vertices (3) 3
apexes (2) 2
cardinality (2) 2
discrete mathematics (2) 2
integers (2) 2
number (2) 2
signed double roman domination (2) 2
trees (2) 2
upper bounds (2) 2
05c12 (1) 1
05c69 (1) 1
applications of mathematics (1) 1
chemistry/food science, general (1) 1
combinatorics (1) 1
distance domination (1) 1
domina-tion (1) 1
domination number (1) 1
double roman domination number (1) 1
double stars (1) 1
earth sciences, general (1) 1
engineering (1) 1
engineering, general (1) 1
geodesy (1) 1
independence (1) 1
independent transversal domination (1) 1
leaves (1) 1
lidocaine (1) 1
life sciences, general (1) 1
literature (1) 1
materials science, general (1) 1
mathematical analysis (1) 1
mathematical minima (1) 1
mathematical models (1) 1
mathematical sets (1) 1
mathematical theorems (1) 1
maximal roman domination (1) 1
maximum stable sets (1) 1
multidisciplinary sciences (1) 1
nuclear experiment (1) 1
numbers (1) 1
outer-independent roman domination (1) 1
physics, general (1) 1
polynomials (1) 1
questions (1) 1
realizability (1) 1
restrained domination number (1) 1
roman (1) 1
roman [formula omitted]-domination (1) 1
roman {2}-domination (1) 1
streptomycin (1) 1
total $k$-distance dominating set (1) 1
total $k$-distance domination-critical (1) 1
total domination (1) 1
total domination number (1) 1
total geodetic number (1) 1
total geosetic set (1) 1
total restrained domination number (1) 1
total restrained geodetic number (1) 1
total restrained geodetic set (1) 1
total roman domination (1) 1
transversal (1) 1
treatment (1) 1
trigeminal neuralgia (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Filomat, ISSN 0354-5180, 2017, Volume 31, Issue 13, pp. 4297 - 4304
For two vertices u and v of a graph G, the set I[u, v] consists of all vertices lying on some u v geodesic in G. If S is a set of vertices of G, then I[S] is... 
Total geodetic number | MATHEMATICS | MATHEMATICS, APPLIED | Geodetic set | Geodetic number | Total geosetic set
Journal Article
Applicable analysis and discrete mathematics, ISSN 1452-8630, 10/2016, Volume 10, Issue 2, pp. 501 - 517
A Roman dominating function on a graph 𝐺 is a function 𝑓: 𝑉 (𝐺) → {0, 1, 2} satisfying the condition that every vertex 𝑢 for which 𝑓(𝑢) = 0 is adjacent... 
Leaves | Literature | Mathematical theorems | Cardinality | Double stars | Discrete mathematics | Mathematical functions | Graph theory | Mathematical minima | Vertices | Roman domination | Total Roman domination | Total domination | Domina-tion | Domination | MATHEMATICS | MATHEMATICS, APPLIED
Journal Article
Filomat, ISSN 0354-5180, 1/2016, Volume 30, Issue 2, pp. 293 - 303
A dominating set of a graph 𝐺 which intersects every independent set of maximum cardinality in 𝐺 is called an independent transversal dominating set. The... 
Integers | Cardinality | Mathematical sets | Polynomials | Graph theory | Vertices | Realizability | Domination | Transversal | Independent transversal domination | Independence | MATHEMATICS | MATHEMATICS, APPLIED | NUMBER | MAXIMUM STABLE SETS
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 12/2017, Volume 232, pp. 1 - 7
A double Roman dominating function (DRDF) on a graph G=(V,E) is a function f:V(G)→{0,1,2,3} having the property that if f(v)=0, then vertex v has at least two... 
Roman [formula omitted]-domination | Double Roman domination | Roman domination | Roman {2}-domination | MATHEMATICS, APPLIED | NUMBER
Journal Article
Filomat, ISSN 0354-5180, 1/2015, Volume 29, Issue 6, pp. 1361 - 1368
For two vertices 𝑢 and 𝑣 of a graph 𝐺, the set 𝐼[𝑢, 𝑣] consists of all vertices lying on some 𝑢 - 𝑣 geodesic in 𝐺. If 𝑆 is a set of vertices of 𝐺,... 
Integers | Discrete mathematics | Numbers | Graph theory | Geodesy | Vertices | Geodetic set | Geodetic number | MATHEMATICS | MATHEMATICS, APPLIED | geodetic number | geodetic set
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2019, Volume 257, pp. 1 - 11
A signed double Roman dominating function (SDRDF) on a graph G=(V,E) is a function f:V(G)→{−1,1,2,3} such that (i) every vertex v with f(v)=−1 is adjacent to... 
Double Roman domination | Signed double Roman domination | Roman domination | MATHEMATICS, APPLIED | Minimum weight | Graphs | Mathematical functions | Trees (mathematics) | Apexes
Journal Article
International Journal of Computer Mathematics, ISSN 0020-7160, 12/2017, Volume 94, Issue 12, pp. 2547 - 2557
A Roman dominating function (RDF) on a graph G is a function satisfying the condition that every vertex u for which is adjacent to at least one vertex v for... 
Roman domination | outer-independent Roman domination | MATHEMATICS, APPLIED | 05C69 | Minimum weight | Graphs | Mathematical functions | Upper bounds
Journal Article
Filomat, ISSN 0354-5180, 2019, Volume 33, Issue 1, pp. 121 - 134
In this paper we continue the study of signed double Roman dominating functions in graphs. A signed double Roman dominating function (SDRDF) on a graph G = (V,... 
MATHEMATICS | Double Roman domination | MATHEMATICS, APPLIED | signed double Roman domination
Journal Article
Iranian Journal of Science and Technology, Transactions A: Science, ISSN 1028-6276, 6/2017, Volume 41, Issue 2, pp. 473 - 480
...RESEARCH PAPER Total Restrained Geodetic Number of Graphs Hossein Abdollahzadeh Ahangar 1 • Maryam Najimi 1 Received: 16 October 2016 / Accepted: 22 February... 
Engineering | Geodetic set | Total restrained geodetic set | 05C12 | Life Sciences, general | Chemistry/Food Science, general | Materials Science, general | Earth Sciences, general | Geodetic number | Engineering, general | Physics, general | Total restrained geodetic number | MULTIDISCIPLINARY SCIENCES | Graphs | Graph theory
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 12/2017, Volume 232, p. 1
A double Roman dominating function (DRDF) on a graph G=(V,E) is a function f:V(G)→{0,1,2,3} having the property that if f(v)=0, then vertex v has at least two... 
Minimum weight | Graphs | Mathematical functions | Mathematics | Combinatorics
Journal Article
International Journal of Computer Mathematics, ISSN 0020-7160, 07/2016, Volume 93, Issue 7, pp. 1093 - 1102
A Roman dominating function (RDF) for a graph is a function satisfying the condition that every vertex u of G for which is adjacent to at least one vertex v of... 
Roman domination | maximal Roman domination | MATHEMATICS, APPLIED | Graphs | Mathematical functions | Minimum weight | Trees | Mathematical analysis | Images | Mathematical models | Roman
Journal Article
R.A.I.R.O. Recherche opérationnelle, ISSN 0399-0559, 04/2020
Let $G=(V,E)$ be a simple graph with vertex set $V$ and edge set $E$. A mixed Roman dominating function (MRDF) of $G$ is a function $f:V\cup E\rightarrow... 
Journal Article
Majallah-i dānishgāh-i ulū m-i pizishkī Māzandarān, ISSN 1735-9279, 2018, Volume 28, Issue 167, pp. 21 - 28
Journal Article
Transactions on combinatorics, ISSN 2251-8657, 09/2016, Volume 5, Issue 3, pp. 1 - 9
A set $S$ of vertices in a graph $G=(V,E)$ is called a total$k$-distance dominating set if every vertex in $V$ is withindistance $k$ of a vertex in $S$. A... 
total $k$-distance dominating set | total $k$-distance domination-critical | Distance domination
Journal Article
Mathematical Sciences, ISSN 2008-1359, 12/2013, Volume 7, Issue 1, pp. 1 - 6
... domination in graphs of diameter 2 or 3 Zahra Tahmasbzadehbaee 1 , D Soner Nandappa 1 , Hossein Abdollahzadeh Ahangar 2* , Doost Ali Mojdeh 3 and Yancai Zhao 4 Abstract... 
Total restrained domination number | Mathematics | Applications of Mathematics | Restrained domination number | Total domination number | Domination number
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 11/2019, Volume 270, pp. 159 - 167
A double Roman dominating function (DRDF) on a graph G=(V,E) is a function f:V→{0,1,2,3} having the property that if f(v)=0, then vertex v must have at least... 
Domination | Roman domination | Double Roman domination number | MATHEMATICS, APPLIED | Minimum weight | Graphs | Mathematical functions | Questions | Apexes | Upper bounds
Journal Article
No results were found for your search.

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