Túri, József (2023) A relationship between global offensive alliance and dominant sets. MULTIDISZCIPLINÁRIS TUDOMÁNYOK: A MISKOLCI EGYETEM KÖZLEMÉNYE, 13 (4). pp. 12-18. ISSN 2062-9737
|
Text
2425_pub.pdf - Published Version Download (496kB) | Preview |
Official URL: https://doi.org/10.35925/j.multi.2023.4.2
Abstract
In this paper we show the relationship between global offensive alliance and dominant sets in the graphs and the random graphs. A global offensive alliance in a graph G=(V, E) is a subset S of V such that for every vertex v not in S at least half of the vertices in the closed neighborhood of v are in S and a dominating set for a graph G is a subset D of its vertices, such that any vertex of G is either in D, or has a neighbor in D.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | graph, global offensive alliance, dominant set |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 24 Apr 2024 14:52 |
| Last Modified: | 24 Apr 2024 14:52 |
| URI: | https://real.mtak.hu/id/eprint/193089 |
Actions (login required)
 |
Edit Item |
