The determining number of Kneser graphs
From MaRDI portal
Publication:5747367
zbMATH Open1283.05122MaRDI QIDQ5747367FDOQ5747367
A. Márquez, Delia Garijo, M. L. Puertas, Jose Cáceres, Antonio González
Publication date: 14 February 2014
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2072/0.html
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 (20)
- On the base size of the symmetric and the alternating group acting on partitions
- Determining Number of Some Families of Cubic Graphs
- The k-conversion number of regular graphs
- Base size sets and determining sets
- Fixing numbers for matroids
- Edge-locating coloring of graphs
- Determining Number of Kneser Graphs: Exact Values and Improved Bounds
- On the fixing sets of dihedral groups
- Title not available (Why is that?)
- The Wiener number of Kneser graphs
- The base size of the symmetric group acting on subsets
- Identifying graph automorphisms using determining sets
- Fixing numbers of graphs with symmetric and generalized quaternion symmetry groups
- Statistics for \(S_n\) acting on \(k\)-sets
- The determining number of a Cartesian product
- The isometry group of phylogenetic tree space is $S_n$
- A classification of finite primitive IBIS groups with alternating socle
- Using determining sets to distinguish Kneser graphs
- Minimal degree, base size, order: selected topics on primitive permutation groups
- Graphs of order \(n\) with determining number \(n-3\)
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)
