The partition dimension of the vertex amalgamation of some cycles
Let G=(V(G),E(G)) be a connected, finite, simple, and undirected graph. The distance between two vertices u,w∈V(G), denoted by d(u,w), is the shortest length of (u,w)-path in G. The distance between a vertex v∈V(G) is defined as min{d(v,x):x∈S} where S⊂V(G), denoted by d(v,S). For an ordered partit...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2022-06-01
|
| Series: | Heliyon |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2405844022008842 |