E-viri
Recenzirano
Odprti dostop
-
Abdollahzadeh Ahangar, Hossein; Chellali, Mustapha; Sheikholeslami, Seyed Mahmoud
Discrete Applied Mathematics, 12/2017, Letnik: 232Journal Article
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 neighbors assigned 2 under f or one neighbor w with f(w)=3, and if f(v)=1, then vertex v must have at least one neighbor w with f(w)≥2. The weight of a DRDF is the value f(V(G))=∑u∈V(G)f(u). The double Roman domination number γdR(G) is the minimum weight of a DRDF on G. First we show that the decision problem associated with γdR(G) is NP-complete for bipartite and chordal graphs. Then we present some sharp bounds on the double Roman domination number which partially answer an open question posed by Beeler et al. (2016) in their introductory paper on double Roman domination. Moreover, a characterization of graphs G with small γdR(G) is provided.
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.