| Title: | Paired domination in graphs with minimum degree four |
|---|
| Authors: | ID Bujtás, Csilla (Author)
ID Henning, Michael A. (Author) |
|---|
| Files: |  PDF - Presentation file, download (801,52 KB)
MD5: C268F944E8DCB7C999B87C57980824C9
 URL - Source URL, visit https://www.sciencedirect.com/science/article/pii/S0012365X2500531X
|
|---|
| Language: | English |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: |  IMFM - Institute of Mathematics, Physics, and Mechanics
|
|---|
| Abstract: | A set $S$ of vertices in a graph $G$ is a paired dominating set if every vertex of $G$ is adjacent to a vertex in $S$ and the subgraph induced by $S$ admits a perfect matching. The minimum cardinality of a paired dominating set of $G$ is the paired domination number $\gamma_{pr}(G)$ of $G$. We show that if $G$ is a graph of order $n$ and $\delta(G) \ge 4$, then $\gamma_{pr}(G) \le 10n/17 < 0.5883n$. |
|---|
| Keywords: | paired domination, bounds, minimum degree four |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 01.04.2026 |
|---|
| Year of publishing: | 2026 |
|---|
| Number of pages: | 10 str. |
|---|
| Numbering: | Vol. 349, iss. 4, article no. 114923 |
|---|
| PID: | 20.500.12556/DiRROS-27983  |
|---|
| UDC: | 519.17 |
|---|
| ISSN on article: | 0012-365X |
|---|
| DOI: | 10.1016/j.disc.2025.114923 |
|---|
| COBISS.SI-ID: | 270544131 |
|---|
| Note: |
|
|---|
| Publication date in DiRROS: | 05.03.2026 |
|---|
| Views: | 97 |
|---|
| Downloads: | 55 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
