Classification of efficient dominating sets of circulant graphs of degree 5
type: Item
instance of: scholarly article
title: Classification of efficient dominating sets of circulant graphs of degree 5
zbMATH Open document ID: 1493.05232
author: Young Soo Kwon
author: Jaeun Lee
author: Moo Young Sohn
published in: Graphs and Combinatorics
publication date: 2022-07-22T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C25
zbMATH DE Number: 7562204
zbMATH Keywords: efficient dominating sets
zbMATH Keywords: circulant graphs
MaRDI profile type: MaRDI publication profile
full work available at URL: s00373-022-02527-6
OpenAlex ID: W4285394041
cites work: Perfect codes in graphs
cites work: Efficient dominating sets in Cayley graphs.
cites work: Perfect codes in circulant graphs
cites work: Q4368729
cites work: Perfect Codes in Cayley Graphs
cites work: Perfect codes over graphs
cites work: Existence of efficient total dominating sets of circulant graphs of degree 4
cites work: Efficient domination in circulant graphs
cites work: Independent perfect domination sets in Cayley graphs
cites work: Weighted efficient domination problem on some perfect graphs
cites work: Subgroup Perfect Codes in Cayley Graphs
cites work: Efficient domination in circulant graphs with two chord lengths
cites work: The weighted perfect domination problem and its variants
cites work: Total perfect codes in Cayley graphs
cites work: Cyclotomic graphs and perfect codes
DOI: 10.1007/S00373-022-02527-6
description: scientific article; zbMATH DE number 7562204