Infinite graphs with finite 2-distinguishing cost
Research output: Contribution to journal › Article › Research › peer-review
Standard
Infinite graphs with finite 2-distinguishing cost. / Boutin, Debra; Imrich, Wilfried.
In: The electronic journal of combinatorics , Vol. 21, No. 4, 11.12.2014.
In: The electronic journal of combinatorics , Vol. 21, No. 4, 11.12.2014.
Research output: Contribution to journal › Article › Research › peer-review
Harvard
Boutin, D & Imrich, W 2014, 'Infinite graphs with finite 2-distinguishing cost', The electronic journal of combinatorics , vol. 21, no. 4.
APA
Boutin, D., & Imrich, W. (2014). Infinite graphs with finite 2-distinguishing cost. The electronic journal of combinatorics , 21(4).
Vancouver
Boutin D, Imrich W. Infinite graphs with finite 2-distinguishing cost. The electronic journal of combinatorics . 2014 Dec 11;21(4).
Author
Bibtex - Download
@article{91968ade6fde4d6482e40a82155b71c7,
title = "Infinite graphs with finite 2-distinguishing cost",
keywords = "Automorphism, Determining number, Determining set, Distinguishability, Distinguishing number, Infinite graph",
author = "Debra Boutin and Wilfried Imrich",
year = "2014",
month = dec,
day = "11",
language = "English",
volume = "21",
journal = "The electronic journal of combinatorics ",
issn = "1077-8926",
number = "4",
}
RIS (suitable for import to EndNote) - Download
TY - JOUR
T1 - Infinite graphs with finite 2-distinguishing cost
AU - Boutin, Debra
AU - Imrich, Wilfried
PY - 2014/12/11
Y1 - 2014/12/11
KW - Automorphism
KW - Determining number
KW - Determining set
KW - Distinguishability
KW - Distinguishing number
KW - Infinite graph
UR - http://www.scopus.com/inward/record.url?scp=84916899011&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:84916899011
VL - 21
JO - The electronic journal of combinatorics
JF - The electronic journal of combinatorics
SN - 1077-8926
IS - 4
ER -
