Efficient domination in circulant graphs with two chord lengths
type: Item
instance of: scholarly article
title: Efficient domination in circulant graphs with two chord lengths
zbMATH Open document ID: 1184.68046
author: Nenad Obradović
author: Goran Ružić
author: Joseph G. Peters
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 5664815
zbMATH Keywords: circulant graph
zbMATH Keywords: efficient domination
zbMATH Keywords: combinatorial problems
MaRDI profile type: Publication
full work available at URL: j.ipl.2007.02.004
OpenAlex ID: W1995459940
cites work: Hamiltonian decomposition of Cayley graphs of degree 4
cites work: Q3921269
cites work: Efficient dominating sets in Cayley graphs.
cites work: Independent perfect domination sets in Cayley graphs
cites work: Q5284096
cites work: Q4862239
cites work: Q4390615
cites work: Point-symmetric graphs with a prime number of points
DOI: 10.1016/J.IPL.2007.02.004
description: scientific article; zbMATH DE number 5664815