Kneser Graphs California State University, NorthridgeKneser图加利福尼亚州立大学北岭分校.pptVIP

Investigating properties ofKneser Graphs Modesty Briggs California State University, Northridge Sponsored by JPL/NASA Pair program; Funded by NSA and NSF What is a Kneser Graph? For n ≥ 2t + 1, the Kneser graph, K( n, t), is the graph whose vertices are the t subsets of an n-set. Example: K (5, 2) [n]=[5] = { 1, 2, 3, 4, 5} t=2 What is a Kneser? For n ≥ 2t + 1, the Kneser graph, K( n, t), is the graph whose vertices are the t subsets of an n-set. Vertices are adjacent when corresponding subsets are disjoint. PETERSON GRAPH is K (5,2) Definitions Distance – the length o