EUVIMEDEUVIMED entdecken
Crossref

CONNECTED DOM-FORCING SETS IN GRAPHS

P. Susanth, Charles Dominic, K. P. Premodkumar

Advances and Applications in Discrete Mathematics · 2025

DOI: 10.17654/0974165825046 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Advances and Applications in Discrete Mathematics, 2025. Verfasst von P. Susanth und 2 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In a graph , a dominating set is called a dom-forcing set if the sub-graph induced by must form a zero forcing set. The minimum cardinality of such a set is known as the dom-forcing number of the graph , denoted by . A connected dom-forcing set of a graph , is a dom-forcing set of that induces a sub graph of which is connected. The connected dom-forcing number of , , is the minimum size of a connected dom-forcing set. This study delves into the concept of the connected dom-forcing number , examining its properties and characteristics. Furthermore, it seeks to accurately determine for several well-known graphs and their graph products.

Zitieren

APA

Susanth, P., Dominic, C., & Premodkumar, K. P. (2025). CONNECTED DOM-FORCING SETS IN GRAPHS. Advances and Applications in Discrete Mathematics. https://doi.org/10.17654/0974165825046

Vancouver

Susanth P, Dominic C, Premodkumar KP. CONNECTED DOM-FORCING SETS IN GRAPHS. Advances and Applications in Discrete Mathematics. 2025. doi:10.17654/0974165825046

BibTeX
@article{Susanth2025,
  author = {Susanth, P. and Dominic, Charles and Premodkumar, K. P.},
  title = {CONNECTED DOM-FORCING SETS IN GRAPHS},
  journal = {Advances and Applications in Discrete Mathematics},
  year = {2025},
  doi = {10.17654/0974165825046}
}
Kostenlos starten →