Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
Opuscula Mathematica · 2024 · 543-563
DOI: 10.7494/opmath.2024.44.4.543 ↗Kurz gefasst
Fachartikel in der Zeitschrift Opuscula Mathematica, 2024. Verfasst von Teresa W. Haynes und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 25 Literaturangaben.
Abstract (Originalsprache)
A graph \(G\) whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. We give constructions that yield infinite families of graphs that are TI-graphs, as well as constructions that yield infinite families of graphs that are not TI-graphs. We study regular graphs that are TI-graphs. Among other results, we prove that all toroidal graphs are TI-graphs.
Zitieren
APA
Haynes, T. W., & Henning, M. A. (2024). Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set. Opuscula Mathematica, 543-563. https://doi.org/10.7494/opmath.2024.44.4.543
Vancouver
Haynes TW, Henning MA. Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set. Opuscula Mathematica. 2024:543-563. doi:10.7494/opmath.2024.44.4.543
BibTeX
@article{Haynes2024,
author = {Haynes, Teresa W. and Henning, Michael A.},
title = {Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set},
journal = {Opuscula Mathematica},
year = {2024},
pages = {543--563},
doi = {10.7494/opmath.2024.44.4.543}
}
EUVIMED