$s$-Stable Kneser Graph are Hamiltonian
Copyright policy )$s$-Stable Kneser Graph are Hamiltonian
The Kneser Graph $K(n,k)$ has as vertices all $k$-subsets of $\{1,\ldots,n\}$ and edges connecting two vertices if they are disjoint. The $s$-stable Kneser Graph $K_{s-\text{stab}}(n, k)$ is obtained from the Kneser graph by deleting vertices with elements at cyclic distance less than $s$. In this article, we show that connected $s$-Stable Kneser graphs are Hamiltonian.
- National Scientific and Technical Research Council Argentina
- National University of San Luis Argentina
Eulerian and Hamiltonian graphs, Graph algorithms (graph-theoretic aspects), FOS: Mathematics, Mathematics - Combinatorics, Structural characterization of families of graphs, Combinatorics (math.CO)
Eulerian and Hamiltonian graphs, Graph algorithms (graph-theoretic aspects), FOS: Mathematics, Mathematics - Combinatorics, Structural characterization of families of graphs, Combinatorics (math.CO)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!