Transmission in H-naphtalenic nanosheet

Jane Olive Sharon, T.M. Rajalaxmi, Sandi Klavžar, R. Sundara Rajan and Indra Rajasingh

Applied Mathematics and Computation, 2021, vol. 406, issue C

Abstract: 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.

Keywords: Vertex transmission; Nano-network; H-naphtalenic nonosheet; Coordinatization; Edge cut (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630032100374X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:406:y:2021:i:c:s009630032100374x

DOI: 10.1016/j.amc.2021.126285

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().