The general position problem and strong resolving graphs
The general position number gp(G) of a connected graph G is the cardinality of a largest set S of vertices such that no three pairwise distinct vertices from S lie on a common geodesic. It is proved that gp(G) ≥ ω(GSR), where GSR is the strong resolving graph of G, and ω(GSR) is its clique number. T...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2019-10-01
|
| Series: | Open Mathematics |
| Subjects: | |
| Online Access: | http://www.degruyter.com/view/j/math.2019.17.issue-1/math-2019-0088/math-2019-0088.xml?format=INT |