Determining Number of Kneser Graphs: Exact Values and Improved Bounds
The determining number of a graph G = (V,E) is the minimum cardinality of a set S ⊆ V such that pointwise stabilizer of S under the action of Aut(G) is trivial. In this paper, we provide some improved upper and lower bounds on the determining number of Kneser graphs. Moreover, we provide the exact v...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics and Theoretical Computer Science
2022
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |