Resolving sets of vertices with the minimum size in graphs
Suppose that $G$ is a simple connected graph with vertex set $V(G)$ and edge set $E(G)$. A subset $S=\{s_1, s_2,\ldots , s_l \}$ of vertices of graph $G$ is called a doubly resolving set of $G$, if for any distinct vertices $u$ and $v$ in $G$ there are elements $x$ and $y$ in the set $S$ such that $...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
University of Isfahan
2023-10-01
|
| Series: | ریاضی و جامعه |
| Subjects: | |
| Online Access: | https://math-sci.ui.ac.ir/article_27889_5b79157dd0ab0effff7459beabfc0c47.pdf |