On a Class of Graphs with Large Total Domination Number

Basit Öğe Kaydı
dc.contributor.authorBahadir, Selim
dc.contributor.authorGözüpek, Didem
dc.date.accessioned2025-10-29T11:36:58Z
dc.date.issued2018
dc.departmentFakülteler, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümü
dc.description.abstractLet gamma(G) and gamma(t) (G) denote the domination number and the total domination number, respectively, of a graph G with no isolated vertices. It is well-known that gamma(t) (G) <= 2 gamma(G). We provide a characterization of a large family of graphs (including chordal graphs) satisfying gamma(t) (G) = 2 gamma(G), strictly generalizing the results of Henning (2001) and Hou and Xu (2010), and partially answering an open question of Henning (2009).
dc.description.sponsorshipScientific and Technological Research Council of Turkey (TUBITAK) [114E731]
dc.description.sponsorshipThis work is supported by the Scientific and Technological Research Council of Turkey (TUBITAK) under grant no. 114E731.
dc.identifier.issn1462-7264
dc.identifier.issn1365-8050
dc.identifier.issue1
dc.identifier.orcid0000-0003-1533-7194
dc.identifier.scopus2-s2.0-85049388161
dc.identifier.scopusqualityQ3
dc.identifier.urihttps://hdl.handle.net/20.500.14854/13566
dc.identifier.volume20
dc.identifier.wosWOS:000489685900014
dc.identifier.wosqualityQ4
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherDiscrete Mathematics Theoretical Computer Science
dc.relation.ispartofDiscrete Mathematics and Theoretical Computer Science
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/openAccess
dc.snmzKA_WOS_20251020
dc.subjectdomination number
dc.subjecttotal domination number
dc.titleOn a Class of Graphs with Large Total Domination Number
dc.typeArticle

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Mühendislik Fakültesi Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu