On the domination number of 2-dimensional torus graphs

Simon Crevals; Patric R.J. Östergard

On the domination number of 2-dimensional torus graphs

Simon Crevals, Patric R.J. Östergard

Information Theory

Research output: Contribution to journal › Article › Scientific › peer-review

6 Citations (Scopus)

Abstract

The domination number of the mxn torus graph is denoted by 7(C_m□C_n). Here, an algorithm based on dynamic programming is presented which can be used to determine i(C_m□C_n) as a function of n when m is fixed. The value of 7(C_m□C_n) has previously been determined for m < 10 and arbitrary n. These results are here extended to m < 20 and arbitrary n.

Original language	English
Pages (from-to)	289-300
Number of pages	12
Journal	Utilitas Mathematica
Volume	106
Publication status	Published - 1 Mar 2018
MoE publication type	A1 Journal article-refereed

Cite this

@article{8a7c170db9e04883920a187657b5a5e9,

title = "On the domination number of 2-dimensional torus graphs",

abstract = "The domination number of the mxn torus graph is denoted by 7(Cm□Cn). Here, an algorithm based on dynamic programming is presented which can be used to determine i(Cm□Cn) as a function of n when m is fixed. The value of 7(Cm□Cn) has previously been determined for m < 10 and arbitrary n. These results are here extended to m < 20 and arbitrary n.",

author = "Simon Crevals and {\"O}stergard, {Patric R.J.}",

year = "2018",

month = mar,

day = "1",

language = "English",

volume = "106",

pages = "289--300",

journal = "Utilitas Mathematica",

issn = "0315-3681",

publisher = "Utilitas Mathematica Publishing Inc.",

}

TY - JOUR

T1 - On the domination number of 2-dimensional torus graphs

AU - Crevals, Simon

AU - Östergard, Patric R.J.

PY - 2018/3/1

Y1 - 2018/3/1

N2 - The domination number of the mxn torus graph is denoted by 7(Cm□Cn). Here, an algorithm based on dynamic programming is presented which can be used to determine i(Cm□Cn) as a function of n when m is fixed. The value of 7(Cm□Cn) has previously been determined for m < 10 and arbitrary n. These results are here extended to m < 20 and arbitrary n.

AB - The domination number of the mxn torus graph is denoted by 7(Cm□Cn). Here, an algorithm based on dynamic programming is presented which can be used to determine i(Cm□Cn) as a function of n when m is fixed. The value of 7(Cm□Cn) has previously been determined for m < 10 and arbitrary n. These results are here extended to m < 20 and arbitrary n.

UR - http://www.scopus.com/inward/record.url?scp=85045087996&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85045087996

SN - 0315-3681

VL - 106

SP - 289

EP - 300

JO - Utilitas Mathematica

JF - Utilitas Mathematica

ER -

On the domination number of 2-dimensional torus graphs

Abstract

Other files and links

Fingerprint

Cite this