Perfect double Italian and double Italian domination on Sierpiński graphs

For a given graph [Formula: see text], a Roman [Formula: see text]-dominating function or double Italian dominating function (abbreviated DIDF) is a function [Formula: see text] which satisfies the following condition: [Formula: see text], [Formula: see text]. The weight of a Roman [Formula: see text]-dominating function or double Italian dominating function is the sum [Formula: see text] and the minimum weight of a Roman [Formula: see text]-dominating function [Formula: see text] is the Roman [Formula: see text]-domination number or double Italian domination number, denoted by [Formula: see text] or [Formula: see text]. A perfect double Italian dominating function (abbreviated PDIDF) is a double Italian dominating function such that if [Formula: see text] then [Formula: see text], where [Formula: see text] is the set of vertices adjacent to [Formula: see text] and [Formula: see text]. The minimum weight of a perfect double Italian dominating function on [Formula: see text] is the perfect double Italian domination number of [Formula: see text], denoted by [Formula: see text]. In this paper, we find that [Formula: see text] for [Formula: see text], where [Formula: see text] is generalized Sierpiński graph. A comparison between [Formula: see text] and [Formula: see text] is assessed. Further [Formula: see text] and [Formula: see text] is found when [Formula: see text] is a graph with a single universal vertex and when [Formula: see text] is a graph having at least two universal vertices. We have examined a class of graphs for which [Formula: see text], provided [Formula: see text] has a single universal vertex.

Authors

Institutions

Publication Details

Journal
Discrete Mathematics Algorithms and Applications
Published
2024-10-24
DOI
https://doi.org/10.1142/s1793830924501180
Primary Topic
semigroups and automata theory
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Perfect double Italian and double Italian domination on Sierpiński graphs

Pramada Ramachandran, Nathasha Baby
Discrete Mathematics Algorithms and Applications
semigroups and automata theory
article

Perfect double Italian and double Italian domination on Sierpiński graphs

Pramada Ramachandran, Nathasha Baby
article en

Abstract

For a given graph [Formula: see text], a Roman [Formula: see text]-dominating function or double Italian dominating function (abbreviated DIDF) is a function [Formula: see text] which satisfies the following condition: [Formula: see text], [Formula: see text]. The weight of a Roman [Formula: see text]-dominating function or double Italian dominating function is the sum [Formula: see text] and the minimum weight of a Roman [Formula: see text]-dominating function [Formula: see text] is the Roman [Formula: see text]-domination number or double Italian domination number, denoted by [Formula: see text] or [Formula: see text]. A perfect double Italian dominating function (abbreviated PDIDF) is a double Italian dominating function such that if [Formula: see text] then [Formula: see text], where [Formula: see text] is the set of vertices adjacent to [Formula: see text] and [Formula: see text]. The minimum weight of a perfect double Italian dominating function on [Formula: see text] is the perfect double Italian domination number of [Formula: see text], denoted by [Formula: see text]. In this paper, we find that [Formula: see text] for [Formula: see text], where [Formula: see text] is generalized Sierpiński graph. A comparison between [Formula: see text] and [Formula: see text] is assessed. Further [Formula: see text] and [Formula: see text] is found when [Formula: see text] is a graph with a single universal vertex and when [Formula: see text] is a graph having at least two universal vertices. We have examined a class of graphs for which [Formula: see text], provided [Formula: see text] has a single universal vertex.

Discrete Mathematics Algorithms and ApplicationsVol. 17(07)
Fatima Mata National College (IN), Kerala Kalamandalam (IN)
Openalex Percentile: Top 78%
semigroups and automata theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Perfect double Italian and double Italian domination on Sierpiński graphs — Pramada Ramachandran, Nathasha Baby · Discrete Mathematics Algorithms and Applications (2024) | TGRS Research Map | TGRS