E-viri
Recenzirano
Odprti dostop
-
Volkmann, Lutz
Discussiones Mathematicae. Graph Theory, 02/2017, Letnik: 37, Številka: 1Journal Article
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} satisfying the conditions that (i) ∑ ) ≥ 1 for each ∈ ( ), where ) consists of all vertices of from which arcs go into , and (ii) every vertex for which ) = −1 has an inner neighbor for which ) = 2. The weight of an STRDF is ) = ∑ ). The signed total Roman domination number ) of is the minimum weight of an STRDF on . In this paper we initiate the study of the signed total Roman domination number of digraphs, and we present different bounds on ). In addition, we determine the signed total Roman domination number of some classes of digraphs. Some of our results are extensions of known properties of the signed total Roman domination number ) of graphs
Avtor
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Vnos na polico
Trajna povezava
- URL:
Faktor vpliva
Dostop do baze podatkov JCR je dovoljen samo uporabnikom iz Slovenije. Vaš trenutni IP-naslov ni na seznamu dovoljenih za dostop, zato je potrebna avtentikacija z ustreznim računom AAI.
Leto | Faktor vpliva | Izdaja | Kategorija | Razvrstitev | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Baze podatkov, v katerih je revija indeksirana
Ime baze podatkov | Področje | Leto |
---|
Povezave do osebnih bibliografij avtorjev | Povezave do podatkov o raziskovalcih v sistemu SICRIS |
---|
Vir: Osebne bibliografije
in: SICRIS
To gradivo vam je dostopno v celotnem besedilu. Če kljub temu želite naročiti gradivo, kliknite gumb Nadaljuj.