- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Total Roman domination on the digraphs ; volume:21 ; number:1 ; year:2023 ; extent:7
Open mathematics ; 21, Heft 1 (2023) (gesamt 7)
- Urheber
-
Zhang, Xinhong
Song, Xin
Li, Ruijuan
- DOI
-
10.1515/math-2022-0575
- URN
-
urn:nbn:de:101:1-2023040214025771654725
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:53 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Zhang, Xinhong
- Song, Xin
- Li, Ruijuan
Ähnliche Objekte (12)
Total restrained Roman domination
On efficient total domination
Total domination versus paired domination
Total Roman 3}-domination in Graphs
Signed total Roman domination in digraphs
Total Domination on Tree Operators
Total Domination Versus Domination in Cubic Graphs
When the connected domination number is at most the total domination number
Efficient total domination in digraphs
The complexity of connected domination and total domination by restricted induced graphs
New bounds on the signed total domination number of graphs
New Bounds on the Double Total Domination Number of Graphs
Total restrained Roman domination
On efficient total domination
Total domination versus paired domination
Total Roman 3}-domination in Graphs
Signed total Roman domination in digraphs
Total Domination on Tree Operators
Total Domination Versus Domination in Cubic Graphs
When the connected domination number is at most the total domination number
Efficient total domination in digraphs
The complexity of connected domination and total domination by restricted induced graphs
New bounds on the signed total domination number of graphs
New Bounds on the Double Total Domination Number of Graphs
Total restrained Roman domination
On efficient total domination
Total domination versus paired domination
Total Roman 3}-domination in Graphs
Signed total Roman domination in digraphs
Total Domination on Tree Operators
Total Domination Versus Domination in Cubic Graphs
When the connected domination number is at most the total domination number
Efficient total domination in digraphs
The complexity of connected domination and total domination by restricted induced graphs
New bounds on the signed total domination number of graphs