Restrained domination polynomial of join and corona of graphs
-
Published:2022-06-28
Issue:
Volume:
Page:
-
ISSN:1793-8309
-
Container-title:Discrete Mathematics, Algorithms and Applications
-
language:en
-
Short-container-title:Discrete Math. Algorithm. Appl.
Affiliation:
1. Department of Mathematics, Manonmaniam Sundaranar University, Tirunelveli 627012, Tamilnadu, India
Abstract
Let [Formula: see text] be a simple graph of order [Formula: see text]. A set [Formula: see text] is said to be a restrained set if each vertex in [Formula: see text] is adjacent to a vertex in [Formula: see text]. The restrained polynomial of a graph [Formula: see text] is [Formula: see text] where [Formula: see text] is the number of restrained sets of [Formula: see text] of cardinality [Formula: see text]. A set [Formula: see text] is said to be a restrained dominating set if each vertex in [Formula: see text] is adjacent to a vertex in [Formula: see text] and to a vertex in [Formula: see text]. The restrained domination polynomial of a graph [Formula: see text] is defined by [Formula: see text] where [Formula: see text] is the number of restrained dominating sets of [Formula: see text] of cardinality [Formula: see text]. In this paper, we derive restrained domination polynomial of join and corona of any two graphs.
Funder
University Grants Commission
Publisher
World Scientific Pub Co Pte Ltd
Subject
Discrete Mathematics and Combinatorics
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the (total) restrained double Italian domination of central of graphs;Discrete Mathematics, Algorithms and Applications;2023-12-08
2. Further results on (total) restrained Italian domination;Discrete Mathematics, Algorithms and Applications;2023-03-25