Twins and Vertex- Identification on Graphs
From MaRDI portal
Publication:6289974
arXiv1708.03121MaRDI QIDQ6289974FDOQ6289974
Authors: Sylvain Gravier, Simon Schmidt, Souad Slimani 
Publication date: 10 August 2017
Abstract: Recently, several vertex identifying notions were introduced (identifying coloring, lid-coloring, ...), these notions were inspired by identifying codes. All of them, as well as original identifying code, are based on separating two vertices according to some conditions on their closed neighborhood. Therefore, twins can not be identified. So most of known results focus on twin-free graph. Here, we show how twins can modify optimal value of vertex-identifying parameters for identifying coloring and locally identifying coloring. extbf{Keyword :} Identifying coloring, locally identifying coloring, twins, separating.
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
This page was built for publication: Twins and Vertex- Identification on Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6289974)
