Cardinality bounds on subsets in the partition resolving set for complex convex polytope-like graph
Let $ G = (V, E) $ be a simple, connected graph with vertex set $ V(G) $ and $ E(G) $ edge set of $ G $. For two vertices $ a $ and $ b $ in a graph $ G $, the distance $ d(a, b) $ from $ a $ to $ b $ is the length of shortest path $ a-b $ path in $ G $. A $ k $-ordered partition of vertices of $ G...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2024-03-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://aimspress.com/article/doi/10.3934/math.2024493?viewType=HTML |