Publication:
Bounds on the Domination Numbers of δ-Complement Graphs

Simple item page
dc.contributor.authorTangjai W.
dc.contributor.authorDarayon C.
dc.contributor.authorVichitkunakorn P.
dc.contributor.authorMaungchang R.
dc.contributor.authorPho-On W.
dc.contributor.correspondenceTangjai W.
dc.contributor.otherSrinakharinwirot University
dc.date.accessioned2026-03-12T06:24:31Z
dc.date.issued2026-02-01
dc.date.issuedBE2569-02-01
dc.description.abstractThis study examines the (Formula presented.) -complements of graphs—a specific type of graph complement whose adjacency depends on the adjacency of the vertices with identical degrees in the original graph. More specifically, we study this type of complement regarding the domination number. We provide sharp Nordhaus–Gaddum-type bounds on the domination number of a graph and its (Formula presented.) -complement. We also provide sharp bounds on the domination numbers of the (Formula presented.) -complements of joined graphs and Cartesian product graphs.
dc.identifier.citationMathematics Vol.14 No.4 (2026)
dc.identifier.doi10.3390/math14040734
dc.identifier.eissn22277390
dc.identifier.scopus2-s2.0-105031366986
dc.identifier.urihttps://hdl.handle.net/20.500.14740/55295
dc.rights.holderSCOPUS
dc.subjectComputer Science
dc.subjectEngineering
dc.subjectMathematics
dc.titleBounds on the Domination Numbers of δ-Complement Graphs
dc.typeArticle
dspace.entity.typePublication
oaire.citation.issue4
oaire.citation.titleMathematics
oaire.citation.volume14
oairecerif.author.affiliationPrince of Songkla University
oairecerif.author.affiliationMahasarakham University
oairecerif.author.affiliationSrinakharinwirot University
oairecerif.author.affiliationWalailak University
oairecerif.author.affiliationDhonburi Rajabhat University
swu.datasource.scopushttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=105031366986&origin=inward

Files

Collections

Scopus: Year 2026