Sylvain Gravier ; Svante Janson ; Tero Laihonen ; Sanna Ranto - Graphs where every k-subset of vertices is an identifying set

dmtcs:1253 - Discrete Mathematics & Theoretical Computer Science, March 1, 2014, Vol. 16 no. 1 - https://doi.org/10.46298/dmtcs.1253
Graphs where every k-subset of vertices is an identifying setArticle

Authors: Sylvain Gravier ORCID1,2; Svante Janson 3,4; Tero Laihonen ORCID5; Sanna Ranto ORCID6

Let G=(V,E) be an undirected graph without loops and multiple edges. A subset CV is called \emph{identifying} if for every vertex xV the intersection of C and the closed neighbourhood of x is nonempty, and these intersections are different for different vertices x. Let k be a positive integer. We will consider graphs where \emph{every} k-subset is identifying. We prove that for every k>1 the maximal order of such a graph is at most 2k2. Constructions attaining the maximal order are given for infinitely many values of k. The corresponding problem of k-subsets identifying any at most vertices is considered as well.


Volume: Vol. 16 no. 1
Section: Combinatorics
Published on: March 1, 2014
Accepted on: July 23, 2015
Submitted on: February 16, 2010
Keywords: [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]

Consultation statistics

This page has been seen 508 times.
This article's PDF has been downloaded 667 times.