%A Felix, Juliana P.
%A Cappelle, Márcia R.
%D 2023
%T Bounds on Identifying Codes in the Cartesian Product of a Star and a Path Graph
%K
%X In a graph, an identifying code (or ID code, for short) is a dominating set with the property that the closed neighborhood of each vertex in the graph has a distinct intersection with the set. Thus every vertex can be uniquely identified by this intersection. The ID code number of a graph G is the minimum cardinality of an ID code of G and is denoted by γ ID (G). We present lower and upper bounds for γ ID in the Cartesian product of star and path graphs.
%U https://sol.sbc.org.br/index.php/etc/article/view/24741
%J Anais do Encontro de Teoria da Computação (ETC)
%0 Journal Article
%R 10.5753/etc.2023.230607
%P 55-59%@ 2595-6116
%8 2023-08-06