Show simple item record

Efficient domination in Cayley graphs of generalized dihedral groups

dc.contributor.authorÇalışkan, Cafer
dc.contributor.authorMiclavic, Stefko
dc.contributor.authorÖzkan, Sibel
dc.contributor.authorSparl, Primoz
dc.date.accessioned2021-04-19T07:03:45Z
dc.date.available2021-04-19T07:03:45Z
dc.date.issued2020
dc.identifier.citationÇalışkan, C., Miclavic, S., Özkan, S. & Sparl, P. (2020). Efficient domination in Cayley graphs of generalized dihedral groups. Discussiones Mathematicae Graph Theory, 1-19.en_US
dc.identifier.issn1234-3099
dc.identifier.urihttp://hdl.handle.net/20.500.12566/767
dc.description.abstractAn independent subset D of the vertex set V of the graph is an effcient dominating set for this graph if each vertex v in V \ D has precisely one neighbour in D. In this article, we classify the connected cubic Cayley graphs on generalized dihedral groups which admit an effcient dominating set.en_US
dc.description.sponsorshipNo sponsoren_US
dc.language.isoengen_US
dc.publisherDiscussiones Mathematicae Graph Theoryen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectEfficient dominationen_US
dc.subjectCayley graphen_US
dc.subjectGeneralized dihedral groupen_US
dc.subjectEtkili hakimiyettr_TR
dc.subjectCayley grafiğitr_TR
dc.subjectGenelleştirilmiş dihedral grubutr_TR
dc.titleEfficient domination in Cayley graphs of generalized dihedral groupsen_US
dc.typeinfo:eu-repo/semantics/articleen_US
dc.relation.publicationcategoryInternational publicationen_US
dc.identifier.scopus2-s2.0-85083043991
dc.identifier.startpage1
dc.identifier.endpage19
dc.contributor.orcid0000-0002-9619-9207 [Çalışkan, Cafer]
dc.contributor.abuauthorÇalışkan, Cafer
dc.contributor.yokid185712 [Çalışkan, Cafer]
dc.contributor.ScopusAuthorID57212863186 [Çalışkan, Cafer]
dc.identifier.doi10.7151/dmgt.2309


Files in this item

Thumbnail
Name:
Efficient domination in Cayley ...
Size:
362.9Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record