Dom-forcing sets in graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913569720762368 |
|---|---|
| author | P, Susanth Dominic, Charles P, Premodkumar K |
| author_facet | P, Susanth Dominic, Charles P, Premodkumar K |
| contents | A dominating set $D_{f}\subseteq V(G)$ of vertices in a graph $G$ is called a \emph{dom-forcing set} if the sub-graph induced by $\langle D_{f} \rangle$ must form a zero forcing set. The minimum cardinality of such a set is known as the dom-forcing number of the graph $G$, denoted by $F_{d}(G)$. This article embarks on an exploration of the dom-forcing number of a graph $G$. Additionally, it delves into the precise determination of $F_{d}(G)$ for certain well-known graphs |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_00580 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Dom-forcing sets in graphs P, Susanth Dominic, Charles P, Premodkumar K Combinatorics 05C50, 05C69 A dominating set $D_{f}\subseteq V(G)$ of vertices in a graph $G$ is called a \emph{dom-forcing set} if the sub-graph induced by $\langle D_{f} \rangle$ must form a zero forcing set. The minimum cardinality of such a set is known as the dom-forcing number of the graph $G$, denoted by $F_{d}(G)$. This article embarks on an exploration of the dom-forcing number of a graph $G$. Additionally, it delves into the precise determination of $F_{d}(G)$ for certain well-known graphs |
| title | Dom-forcing sets in graphs |
| topic | Combinatorics 05C50, 05C69 |
| url | https://arxiv.org/abs/2411.00580 |