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.

中文翻译：

---

H-萘萘酚纳米片中的透射。

在网络分析中，中心度度量确定图形中最重要的顶点。在连接图中，顶点的传输$ü$是图中节点与所有其他节点之间的最短路径长度的总和。在本文中，我们讨论了一种唯一识别平面纳米片中顶点的方法。使用这种方法，我们可以计算H-萘烷纳米片中每个顶点的透射率。