Computing Edge Metric Dimension of One-Pentagonal Carbon Nanocone
Minimum resolving sets (edge or vertex) have become an integral part of molecular topology and combinatorial chemistry. Resolving sets for a specific network provide crucial information required for the identification of each item contained in the network, uniquely. The distance between an edge e =...
Guardado en:
Autores principales: | , , |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Frontiers Media S.A.
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/ab429ad7a12a4d0788ca3e99ddf5fb44 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Sumario: | Minimum resolving sets (edge or vertex) have become an integral part of molecular topology and combinatorial chemistry. Resolving sets for a specific network provide crucial information required for the identification of each item contained in the network, uniquely. The distance between an edge e = cz and a vertex u is defined by d(e, u) = min{d(c, u), d(z, u)}. If d(e1, u) ≠ d(e2, u), then we say that the vertex u resolves (distinguishes) two edges e1 and e2 in a connected graph G. A subset of vertices RE in G is said to be an edge resolving set for G, if for every two distinct edges e1 and e2 in G we have d(e1, u) ≠ d(e2, u) for at least one vertex u ∈ RE. An edge metric basis for G is an edge resolving set with minimum cardinality and this cardinality is called the edge metric dimension edim(G) of G. In this article, we determine the edge metric dimension of one-pentagonal carbon nanocone (1-PCNC). We also show that the edge resolving set for 1-PCNC is independent. |
---|