Artykuł  

Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set

Krótki opis
creativeworkseries.issn1232-9274
dc.contributor.authorHaynes, Teresa W.
dc.contributor.authorHenning, Michael A.
dc.date.issued2024
dc.description.abstractA 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.en
dc.description.placeOfPublicationKraków
dc.description.versionwersja wydawnicza
dc.identifier.doihttps://doi.org/10.7494/OpMath.2024.44.4.543
dc.identifier.eissn2300-6919
dc.identifier.issn1232-9274
dc.identifier.urihttps://repo.agh.edu.pl/handle/AGH/108413
dc.language.isoeng
dc.publisherWydawnictwa AGH
dc.rightsAttribution 4.0 International
dc.rights.accessotwarty dostęp
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/legalcode
dc.subjecttotal dominationen
dc.subjectvertex partitionsen
dc.subjectindependent dominationen
dc.titleGraphs whose vertex set can be partitioned into a total dominating set and an independent dominating seten
dc.title.relatedOpuscula Mathematica
dc.typeartykuł
dspace.entity.typePublication
publicationissue.issueNumberNo. 4
publicationissue.paginationpp. 543-563
publicationvolume.volumeNumberVol. 44
relation.isJournalIssueOfPublication958a565f-0ba8-4db5-bbd6-a87484b6015d
relation.isJournalIssueOfPublication.latestForDiscovery958a565f-0ba8-4db5-bbd6-a87484b6015d
relation.isJournalOfPublication304b3b9b-59b9-4830-9178-93a77e6afbc7
Pliki
Pakiet podstawowy
Teraz pokazywane1 - 1 z 1
Miniatura
Nazwa:
OpMath.2024.44.4.543.pdf
Rozmiar:
636.06 KB
Format:
Adobe Portable Document Format
Opis:
Pobierz
Kolekcje
Artykuły (CN-OpMath)