Partition dimension of disjoint union of complete bipartite graphs
For any (not necessary connected) graph $G(V,E)$ and $A\subseteq V(G)$, the distance of a vertex $x\in V(G)$ and $A$ is $d(x,A)=\min\{d(x,a): a\in A\}$. A subset of vertices $A$ resolves two vertices $x,y \in V(G)$ if $d(x,A)\neq d(y,A)$. For an ordered partition $\Lambda=\{A_1, A_2,\ldots, A_k\}$ o...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | Indonesian |
| Published: |
Universitas Islam Negeri Raden Intan Lampung
2021-07-01
|
| Series: | Desimal |
| Subjects: | |
| Online Access: | http://ejournal.radenintan.ac.id/index.php/desimal/article/view/10190 |