Inverse Domination Parameters of Jump Graph
Let G=(V,E)\ be a connected graph. Let D be a minimum dominating set in G.\ If V-D contains a dominating set D^\prime of G, then D^\prime is called an inverse dominating set with respect to D. Theminimum cardinality of an inverse dominating set of G is called inverse domination number of G. In this...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Accademia Piceno Aprutina dei Velati
2023-01-01
|
Series: | Ratio Mathematica |
Subjects: | |
Online Access: | http://eiris.it/ojs/index.php/ratiomathematica/article/view/1001 |
Summary: | Let G=(V,E)\ be a connected graph. Let D be a minimum dominating set in G.\ If V-D contains a dominating set D^\prime of G, then D^\prime is called an inverse dominating set with respect to D. Theminimum cardinality of an inverse dominating set of G is called inverse domination number of G. In this article, we determine inverse domination parameters of jump graph of a graph. |
---|---|
ISSN: | 1592-7415 2282-8214 |