Tight Bounds for Domination-Based Identification Problems in Block Graphs

The paper establishes tight lower and upper bounds for the identifying code number, locating-dominating code number, and open locating-dominating code number of block graphs, in terms of the number of blocks and the order of the graph.