Computing Metric and Connected Metric Dimension of Some Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v18i3.6438Keywords:
Algebraic Graph, metric basis, resolving set, metric dimensions, Connected metric dimensions, Algorithm, Network security, Edge ComputingAbstract
For a connected graph G=(V, E), a set of vertices B ⊆ V(G) resolves G if every vertex of G is uniquely determined by its vector of distances to the vertices in B. Mathematically: r(v | B) = (d(v, x₁), d(v, x₂), ..., d(v, xₖ)) is unique for every v in V(G). A metric basis B of G is connected if the subgraph induced by B is a nontrivial connected subgraph of G. The cardinality number of the connected metric basis is the connected metric dimension of G and is denoted cdim(G). We will introduce connected metric some graphs and proof them indexing, abstracting, and retrieval purposes. Also we proposing an approximate algorithm which finds a minimum connected metric dimension of a given graph.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Ashraf Elrokh, Eman S. Almotairi, Hoda Mostafa
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.