Dominating sets in Kneser graphs
This thesis investigates dominating sets in Kneser graphs as well as a selection of other topics related to graph domination. Dominating sets in Kneser graphs, especially those of minimum size, often correspond to interesting combinatorial incidence structures. We begin with background on the domi...
Main Author: | Gorodezky, Igor |
---|---|
Language: | en |
Published: |
2007
|
Subjects: | |
Online Access: | http://hdl.handle.net/10012/3190 |
Similar Items
-
Dominating sets in Kneser graphs
by: Gorodezky, Igor
Published: (2007) -
The Graphs of HU+00E4ggkvist & Hell
by: Roberson, David E.
Published: (2009) -
The Graphs of HU+00E4ggkvist & Hell
by: Roberson, David E.
Published: (2009) -
The Super-Connectivity of Kneser Graphs
by: Ekinci Gülnaz Boruzanli, et al.
Published: (2019-02-01) -
The General Position Problem on Kneser Graphs and on Some Graph Operations
by: Ghorbani Modjtaba, et al.
Published: (2021-11-01)