For a connected graph G = V , E , let id="M2"> v ∈ be vertex and id="M3"> e uw an edge. The distance between the id="M4"> edge id="M5"> is given by id="M6"> d</mi...

A minimax converse for the identification via channels is derived. By this converse, a general formula capacity, which coincides with transmission proved without assumption of strong property. Furthermore, optimal second-order coding rate characterized when type I error probability non-vanishing and II vanishing. Our built upon so-called partial channel resolvability approach; however, argument...

Article history: Received 22 January 2009 Accepted 1 December 2009 MSC: primary 05A18, 03E05, 54A10 secondary 03E35, 54A25, 05D05