Designs associated with maximum independent sets of a graph

作者：Walikar H B^*; Acharya B D; Shirkol Shailaja S

来源：Designs, Codes and Cryptography, 2010, 57(1): 91-105.

DOI：10.1007/s10623-009-9351-6

• Designs
• Independence number
• Matching polynomial

A (v, beta (o) , mu)-design over regular graph G = (V, E) of degree d is an ordered pair D = (V, B), where |V| = v and B is the set of maximum independent sets of G called blocks such that if i, j a V, i not equal j and if i and j are not adjacent in G then there are exactly mu blocks containing i and j. In this paper, we study (v, beta (o) , mu)-designs over the graphs K (n) x K (n) , T(n)-triangular graphs, L (2)(n)-square lattice graphs, Petersen graph, Shrikhande graph, Clebsch graph and the Schlafli graph and non-existence of (v, beta (o) , mu)-designs over the three Chang graphs T (1)(8), T (2)(8) and T (3)(8).

• 出版日期2010-10