| Title: | Induced cycles vertex number and $(1,2)$-domination in cubic graphs |
|---|
| Authors: | ID Erveš, Rija (Author) ID Tepeh, Aleksandra (Author) |
| Files: | PDF - Presentation file, download (1,79 MB) MD5: 328285D2CDB1536D5931222CDCF36A58
URL - Source URL, visit https://www.sciencedirect.com/science/article/pii/S0096300325004266
|
|---|
| Language: | English |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | IMFM - Institute of Mathematics, Physics, and Mechanics
|
|---|
| Abstract: | A $(1,2)$-dominating set in a graph ▫$G$▫ is a set $S$ such that every vertex outside $S$ has at least one neighbor in $S$, and each vertex in $S$ has at least two neighbors in $S$. The $(1,2)$-domination number, $\gamma_{1, 2}(G)$, is the minimum size of such a set, while $c_{\rm ind}(G)$ is the cardinality of the largest vertex set in that induces one or more cycles. In this paper, we initiate the study of a relationship between these two concepts and discuss how establishing such a connection can contribute to solving a conjecture on the lower bound of $c_{\rm ind}(G)$ for cubic graphs. We also establish an upper bound on $c_{\rm ind}(G)$ for cubic graphs and characterize graphs that achieve this bound. |
|---|
| Keywords: | cubic graphs, (1, 2)-domination, induced 2-regular subgraphs, induced cycles vertex |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 01.02.2026 |
|---|
| Year of publishing: | 2026 |
|---|
| Number of pages: | 7 str. |
|---|
| Numbering: | Vol. 510, [article no.] 129700 |
|---|
| PID: | 20.500.12556/DiRROS-23831  |
|---|
| UDC: | 519.17 |
|---|
| ISSN on article: | 1873-5649 |
|---|
| DOI: | 10.1016/j.amc.2025.129700  |
|---|
| COBISS.SI-ID: | 247464963  |
|---|
| Note: |
|
|---|
| Publication date in DiRROS: | 09.10.2025 |
|---|
| Views: | 230 |
|---|
| Downloads: | 108 |
|---|
| 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. |