Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/76806
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPiyashat Sriprataken_US
dc.contributor.authorSayan Panmaen_US
dc.date.accessioned2022-10-16T07:18:40Z-
dc.date.available2022-10-16T07:18:40Z-
dc.date.issued2021-12-01en_US
dc.identifier.issn16860209en_US
dc.identifier.other2-s2.0-85122124046en_US
dc.identifier.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85122124046&origin=inwarden_US
dc.identifier.urihttp://cmuir.cmu.ac.th/jspui/handle/6653943832/76806-
dc.description.abstractWe obtain a lower bound and an upper bound of the domination numbers of glued graphs, based on those of the original graphs. We also investigate the domination numbers of glued graphs whose clones are paths and the original graphs are in some specific families of bipartite graphs, namely bipartite fan graphs and firecrackers F cn,3 . Consequently, we use these results to show that our obtained bounds are sharp.en_US
dc.subjectMathematicsen_US
dc.titleOn the Bounds of the Domination Numbers of Glued Graphsen_US
dc.typeJournalen_US
article.title.sourcetitleThai Journal of Mathematicsen_US
article.volume19en_US
article.stream.affiliationsChiang Mai Universityen_US
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.


Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.