On the signed Italian domination of graphs
Close
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
633 34
Ultima descărcare din IBN:
2023-12-19 20:04
Căutarea după subiecte
similare conform CZU
519.171 (4)
Combinatorial analysis. Graph theory (114)
SM ISO690:2012
KARAMZADEH, Ashraf, REZA MAIMANI, Hamid, ZAEEMBASHI, Ali. On the signed Italian domination of graphs. In: Computer Science Journal of Moldova, 2019, nr. 2(80), pp. 204-229. ISSN 1561-4042.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Computer Science Journal of Moldova
Numărul 2(80) / 2019 / ISSN 1561-4042 /ISSNe 2587-4330

On the signed Italian domination of graphs

CZU: 519.171
MSC 2010: 05C69.

Pag. 204-229

Karamzadeh Ashraf, Reza Maimani Hamid, Zaeembashi Ali
 
Shahid Rajaee Teacher Training University
 
Disponibil în IBN: 22 septembrie 2019


Rezumat

A signed Italian dominating function on a graph G = (V,E) is a function f : V → {−1, 1, 2} satisfying the condition that for every vertex u, f[u] ≥ 1. The weight of signed Italian dominating function is the value f(V ) =∑u2V f(u). The signed Italian domination number of a graph G, denoted by sI (G), is the minimum weight of a signed Italian dominating function on a graph G. In this paper, we determine the signed Italian domination number of some classes of graphs. We also present several lower bounds on the signed Italian domination number of a graph. In particular, for a graph G without isolated vertex we show that sI (G) ≥ 3n−4m 2 and characterize all graphs attaining equality in this bound. We show that if G is a graph of order n ≥ 2, then sI (G) ≥ 3pn 2 − n and this bound is sharp

Cuvinte-cheie
Domination, Signed Italian Dominating Function, Signed Italian Domination Number