The determining number of Kneser graphs
From MaRDI portal
Publication:5747367
Recommendations
- Determining Number of Kneser Graphs: Exact Values and Improved Bounds
- Identifying graph automorphisms using determining sets
- Using determining sets to distinguish Kneser graphs
- Graphs of order \(n\) with determining number \(n-3\)
- Determining number of generalized and double generalized Petersen graph
Cited in
(23)- Identifying graph automorphisms using determining sets
- Minimal degree, base size, order: selected topics on primitive permutation groups
- The determining number of a Cartesian product
- The isometry group of phylogenetic tree space is $S_n$
- Determining Number of Kneser Graphs: Exact Values and Improved Bounds
- Fixing numbers of graphs with symmetric and generalized quaternion symmetry groups
- Base size sets and determining sets
- Determining number of some families of cubic graphs
- Fixing numbers for matroids
- On the fixing sets of dihedral groups
- Determining Sets and Determining Numbers of Finite Groups
- Using determining sets to distinguish Kneser graphs
- On the base size of the symmetric and the alternating group acting on partitions
- Statistics for \(S_n\) acting on \(k\)-sets
- The Wiener number of Kneser graphs
- Edge-locating coloring of graphs
- A formula for the base size of the symmetric group in its action on subsets
- The base size of the symmetric group acting on subsets
- The k-conversion number of regular graphs
- Edge-determining sets and determining index
- Graphs of order \(n\) with determining number \(n-3\)
- A classification of finite primitive IBIS groups with alternating socle
- The automorphism group of the bipartite Kneser graph
This page was built for publication: The determining number of Kneser graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5747367)