On the Bounded Partition Dimension of Some Generalised Graph Structures
Consider λ to be a connected graph with a vertex set Vλ that may be partitioned into any partition set S. If each vertex in λ has a separate representation with regard to S and is an ordered k partition, then the set with S is a resolving partition of λ.. A partition dimension of λ, represented by p...
Saved in:
| Main Authors: | Wajdi Alghamdi, Muhammad Ahsan Asim |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/9531182 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
COMPACT PARTITIONS ON LARGE DIMENSION TOPOLOGICAL GRAPHS
by: Alexander V. Pogrebnoy, et al.
Published: (2023-06-01) -
On Partition Dimension and Domination of Abid-Waheed 〖(AW)〗_r^4 Graph
by: Jalal Hatem Hussein Bayati, et al.
Published: (2024-05-01) -
The Mixed Partition Dimension: A New Resolvability Parameter in Graph Theory
by: Siti Norziahidayu Amzee Zamri, et al.
Published: (2025-01-01) -
Computing Bounds of Fractional Metric Dimension of Metal Organic Graphs
by: Mohsin Raza, et al.
Published: (2021-01-01) -
Some Bounds for the Kirchhoff Index of Graphs
by: Yujun Yang
Published: (2014-01-01)