Weak and strong domination on some graphs

Simple item page
dc.contributor.authorDurgun D.D.
dc.contributor.authorKurt B.L.
dc.date.accessioned2024-07-22T08:04:12Z
dc.date.available2024-07-22T08:04:12Z
dc.date.issued2022
dc.description.abstractLet G = (V(G), E(G)) be a graph and uv?E. A subset D âV of vertices is a dominating set if every vertex in V-D is adjacent to at least one vertex of D. The domination number is the minimum cardinality of a dominating set. Let u and v be elements of V. Then, u strongly dominates u and v weakly dominates u if (i)uv?E and (ii)deg(u) ?deg(v). A set D â V is a strong (weak) dominating set (sd-set)(wd-set) of G if every vertex in V-D is strongly dominated by at least one vertex in D. The strong (weak) domination number ?s(?w) of G is the minimum cardinality of a sd-set (wd-set). In this paper, the strong and weak domination numbers of comet, double comet, double star and theta graphs are given. The theta graphs are important geometric graphs that have many applications, including wireless networking, motion planning, MST construction and real-Time animation. © The authors.
dc.identifier.DOI-ID10.1051/ro/2022049
dc.identifier.issn28047303
dc.identifier.urihttp://akademikarsiv.cbu.edu.tr:4000/handle/123456789/12590
dc.language.isoEnglish
dc.publisherEDP Sciences
dc.rightsAll Open Access; Green Open Access; Hybrid Gold Open Access
dc.subjectGraphic methods
dc.subjectMotion planning
dc.subjectCardinalities
dc.subjectConstruction time
dc.subjectDominating sets
dc.subjectDomination
dc.subjectDomination number
dc.subjectDouble stars
dc.subjectGeometric graphs
dc.subjectGraph operations
dc.subjectMotion-planning
dc.subjectWireless networking
dc.subjectGraph theory
dc.titleWeak and strong domination on some graphs
dc.typeArticle

Files

Collections

Scopus Koleksiyonu