In network analysis, centrality measures identify the most important vertices within a graph. In a connected graph, the transmission of a vertex u is the sum of the lengths of the shortest paths between the node and all other nodes in the graph. In this paper, we discuss a method to uniquely identify a vertex in a plane nanosheet. Using this approach, we compute the transmission of every vertex in H-naphtalenic nanosheets. © 2021 Elsevier Inc.