Designs associated with maximum independent sets of a graph

Walikar, H. B. and Acharya, B. D. and Shailaja S. Shirkol, (2010) Designs associated with maximum independent sets of a graph. DESIGNS CODES AND CRYPTOGRAPHY, 57 (1). pp. 91-105.

[img] Text (Full Text)
art%3A10.1007%2Fs10623-009-9351-6.pdf - Published Version
Restricted to Registered users only

Download (610Kb) | Request a copy
Official URL:


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).

Item Type: Article
Uncontrolled Keywords: Designs; Independence number; Matching polynomial
Subjects: Physical Sciences > Mathematics
Divisions: PG Campuses > Manasagangotri, Mysore > Mathematics
Depositing User: Users 7 not found.
Date Deposited: 25 Mar 2013 10:06
Last Modified: 22 Aug 2013 09:16

Actions (login required)

View Item View Item