Determining Number of Kneser Graphs: Exact Values and Improved Bounds

Angsuman Das; Hiranya Kishore Dey

doi:10.46298/dmtcs.7627

Determining Number of Kneser Graphs: Exact Values and Improved Bounds

Combinatorics 2023-06-22 v4

Authors: Angsuman Das , Hiranya Kishore Dey

View on arXiv ↗ PDF ↗ DOI ↗

Abstract

The determining number of a graph $G = (V,E)$ is the minimum cardinality of a set $S\subseteq 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 value of the determining number for some subfamilies of Kneser graphs.

Keywords

determining number kneser graphs graph automorphism upper bounds lower bounds exact values

Cite

@article{arxiv.2009.08787,
  title  = {Determining Number of Kneser Graphs: Exact Values and Improved Bounds},
  author = {Angsuman Das and Hiranya Kishore Dey},
  journal= {arXiv preprint arXiv:2009.08787},
  year   = {2023}
}

Comments

9 pages, 1 figure

Determining Number of Kneser Graphs: Exact Values and Improved Bounds

Abstract

Keywords

Cite

Comments

Related papers