Infinite graphs with finite 2-distinguishing cost

Publikationen: Beitrag in FachzeitschriftArtikelForschung(peer-reviewed)

Standard

Infinite graphs with finite 2-distinguishing cost. / Boutin, Debra; Imrich, Wilfried.
in: The electronic journal of combinatorics , Jahrgang 21, Nr. 4, 11.12.2014.

Publikationen: Beitrag in FachzeitschriftArtikelForschung(peer-reviewed)

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 -