Results 1  10
of
10,157
Algebraic Graph Theory
, 2011
"... Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area is the investiga ..."
Abstract

Cited by 892 (13 self)
 Add to MetaCart
is the investigation of the relation between properties of a graph and the spectrum of its adjacency matrix. A central topic and important source of tools is the theory of association schemes. An association scheme is, roughly speaking, a collection of graphs on a common vertex set which fit together in a highly
A Pairwise Key PreDistribution Scheme for Wireless Sensor Networks
, 2003
"... this paper, we provide a framework in which to study the security of key predistribution schemes, propose a new key predistribution scheme which substantially improves the resilience of the network compared to previous schemes, and give an indepth analysis of our scheme in terms of network resili ..."
Abstract

Cited by 552 (18 self)
 Add to MetaCart
resilience and associated overhead. Our scheme exhibits a nice threshold property: when the number of compromised nodes is less than the threshold, the probability that communications between any additional nodes are compromised is close to zero. This desirable property lowers the initial payoff of smaller
SEMIDIRECT PRODUCTS OF ASSOCIATION SCHEMES
"... Abstract. In his 1996 work developing the theory of association schemes as a ‘generalized ’ group theory, Zieschang introduced the concept of the semidirect product as a possible product operation of certain association schemes. In this paper we extend the semidirect product operation into the ent ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. In his 1996 work developing the theory of association schemes as a ‘generalized ’ group theory, Zieschang introduced the concept of the semidirect product as a possible product operation of certain association schemes. In this paper we extend the semidirect product operation
Association Schemes and Permutation Groups
, 2001
"... Every permutation group which is not 2transitive acts on a nontrivial coherent configuration, but the question of which permutation groups G act on nontrivial association schemes (symmetric coherent configurations) is considerably more subtle. A closely related question is: when is there a unique m ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Every permutation group which is not 2transitive acts on a nontrivial coherent configuration, but the question of which permutation groups G act on nontrivial association schemes (symmetric coherent configurations) is considerably more subtle. A closely related question is: when is there a unique
ON ALGEBRAIC FUSIONS OF ASSOCIATION SCHEMES
"... ABSTRACT. We give a complete description of the irreducible representations of algebraic fusions of association schemes, in terms of the irreducible representations of a Schur cover of the corresponding group of algebraic automorphisms. 1. ..."
Abstract
 Add to MetaCart
ABSTRACT. We give a complete description of the irreducible representations of algebraic fusions of association schemes, in terms of the irreducible representations of a Schur cover of the corresponding group of algebraic automorphisms. 1.
Semidefinite Programs and Association Schemes
, 1999
"... We consider semidenite programs, where all the matrices dening the problem commute. We show that in this case the semidenite program can be solved through an ordinary linear program. As an application, we consider the maxcut problem, where the underlying graph arises from an association scheme. ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We consider semidenite programs, where all the matrices dening the problem commute. We show that in this case the semidenite program can be solved through an ordinary linear program. As an application, we consider the maxcut problem, where the underlying graph arises from an association scheme.
Commutative association schemes
 EUROPEAN J. COMBIN
, 2008
"... Association schemes were originally introduced by Bose and his coworkers in the design of statistical experiments. Since that point of inception, the concept has proved useful in the study of group actions, in algebraic graph theory, in algebraic coding theory, and in areas as far afield as knot ..."
Abstract

Cited by 22 (7 self)
 Add to MetaCart
Association schemes were originally introduced by Bose and his coworkers in the design of statistical experiments. Since that point of inception, the concept has proved useful in the study of group actions, in algebraic graph theory, in algebraic coding theory, and in areas as far afield as knot
A selfclocked fair queueing scheme for broadband applications
 Proceedings of IEEE INFOCOM’94
, 1994
"... A n ef ic ient fa i r queueing scheme which is feasible f o r broadband implementation i s proposed and i ts performance i s analyzed. W e define fairness in a selfcontained manner, eliminating the need f o r the hypothetical fluidflow reference sys tem used in the present state of art and ther ..."
Abstract

Cited by 449 (0 self)
 Add to MetaCart
and thereby removing the associated computational complexity. The scheme i s based on the adoption of an internally generated virtual time as the index of work progress, hence the name selfclocked fair queueing. W e prove that the scheme possesses the desired fairness property and i s nearly optimal
Crested Products Of Association Schemes
"... In this paper, we define a new type of product of association schemes (and of the related objects, permutation groups and orthogonal block structures), which generalizes the direct and wreath products (which are referred to as "crossing" and "nesting" in the statistical literatur ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
In this paper, we define a new type of product of association schemes (and of the related objects, permutation groups and orthogonal block structures), which generalizes the direct and wreath products (which are referred to as "crossing" and "nesting" in the statistical
Designs in Product Association Schemes
 DESIGNS, CODES AND CRYPTOGRAPHY
, 1998
"... Let (Y; A) be an association scheme with primitive idempotents E 0 ; E 1 ; . . . ; E d . For T ` f1; . . . ; dg, a Delsarte T design in (Y; A) is a subset D of Y whose characteristic vector is annihilated by the idempotents E j (j 2 T ). The case most studied is that in which (Y; A) is Qpolynom ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Let (Y; A) be an association scheme with primitive idempotents E 0 ; E 1 ; . . . ; E d . For T ` f1; . . . ; dg, a Delsarte T design in (Y; A) is a subset D of Y whose characteristic vector is annihilated by the idempotents E j (j 2 T ). The case most studied is that in which (Y; A) is Q
Results 1  10
of
10,157