Inverse Hn-domination number in graphs
The aim of this paper is to introduce a new definition of an inverse domination number in graphs called inverse hn- domination number. Let G(V, E) be a connected simple graph. Let D be a minimum hn-dominating set of G. If V−D has hn- dominating set D−1 in G, then D−1 is called an inverse hn-dominati...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | The aim of this paper is to introduce a new definition of an inverse domination number in graphs called inverse hn- domination number. Let G(V, E) be a connected simple graph. Let D be a minimum hn-dominating set of G. If V−D has hn- dominating set D−1 in G, then D−1 is called an inverse hn-dominating set with respect to D.The minimum cardinality of a minimal inverse hn-dominating set is called inverse hn-domination number and denoted by γhn−1(G). Also, some bounds and results for an inverse hn-domination number are established. |
|---|---|
| ISSN: | 0094-243X 1551-7616 |
| DOI: | 10.1063/5.0093690 |