Inverse Italian domination in graphs
Utilitas Mathematica · 26.06.2025 · 123 · 107-123
DOI: 10.61091/um123-08 ↗Kurz gefasst
Fachartikel in der Zeitschrift Utilitas Mathematica, online erschienen am 26.06.2025. Verfasst von Wilma L. D’Souza und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref).
Abstract (Originalsprache)
For a graph \(G\), an Italian dominating function (IDF) is a function \(f: V(G) \rightarrow \{0,1,2\}\) such that all vertices labeled with 0 must have at least two neighbors assigned the label 1 or at least one neighbor assigned the label 2. The weight of \(f\), denoted by \(w(f)\), is calculated by summing all the labels assigned by the function. Let \(f\) be an IDF on \(G\) with a minimum weight, denoted as \(\gamma_I(G)\). If \(S\) is the set of vertices where \(f(v) > 0\), then an Inverse Italian Dominating Function (IIDF) \(f'\) is defined as an IDF on \(G\) such that \(f'(v) = 0\) for all \(v \in S\). The notation \(\gamma_{iI}(G)\) represents the Inverse Italian Domination Number of the graph \(G\), which is the minimum weight among all IIDFs on \(G\). In this paper, we find \(\gamma_{iI}(G)\) of graphs and characterize the graphs for which \(\gamma_I(G) = 2\) and \(3\), as well as those with \(\gamma_{iI}(G) = 2\) and \(3\). Additionally, we provide a characterization of trees and graphs that achieve the largest possible \(\gamma_{iI}(G)\).
Zitieren
APA
D’Souza, W. L., & Chaitra, V. (2025). Inverse Italian domination in graphs. Utilitas Mathematica, 123, 107-123. https://doi.org/10.61091/um123-08
Vancouver
D’Souza WL, Chaitra V. Inverse Italian domination in graphs. Utilitas Mathematica. 2025;123:107-123. doi:10.61091/um123-08
BibTeX
@article{DSouza2025,
author = {D’Souza, Wilma L. and Chaitra, V.},
title = {Inverse Italian domination in graphs},
journal = {Utilitas Mathematica},
year = {2025},
volume = {123},
pages = {107--123},
doi = {10.61091/um123-08}
}
EUVIMED