AbstractSuppose that (X,G) is a primitive association scheme with |G|≥3 and π is an equitable partition of (X,G) with |π|<|X|. We put π∗≔{C∈π∣|C|>1} and supp(π)≔⋃C∈π∗C. In this article we prove that |G|≤|supp(π)|−|π∗|+1, and show a necessary and sufficient condition for the equality to hold
AbstractIn this paper we will define the product of two association schemes and using the fact that ...
In January 1969, Peter M. Neumann wrote a paper entitled "Primitive permutation groups of degree 3p"...
In January 1969, Peter M. Neumann wrote a paper entitled "Primitive permutation groups of degree 3p"...
The well-known absolute bound condition for a primitive symmetric association scheme (X,S) gives an ...
AbstractIn this paper we deal with equitable partitions of association schemes. We try to generalize...
Partitions on a set are partially ordered by nesting: partition F is nested in partition G if every ...
Partitions on a set are partially ordered by nesting: partition F is nested in partition G if every ...
The well-known absolute bound condition for a primitive symmetric association scheme (X,S) gives an ...
AbstractThe theory of equitable partitions of graphs has a number of significant applications. We de...
AbstractPartitions on a set are partially ordered by nesting: partition F is nested in partition G i...
P(論文)"Let Ω = (X, {R_i}_) be commutative association scheme with class d. F_i, is a graph with respe...
We generalize the definition of distribution numbers of an association scheme (with symmetric classe...
We generalize the definition of distribution numbers of an association scheme (with symmetric classe...
Funding: The research of the first author was supported by an Undergraduate Research Bursary, number...
Abstract. Let (X,S) be an association scheme where X is a finite set and S is a partition of X × X. ...
AbstractIn this paper we will define the product of two association schemes and using the fact that ...
In January 1969, Peter M. Neumann wrote a paper entitled "Primitive permutation groups of degree 3p"...
In January 1969, Peter M. Neumann wrote a paper entitled "Primitive permutation groups of degree 3p"...
The well-known absolute bound condition for a primitive symmetric association scheme (X,S) gives an ...
AbstractIn this paper we deal with equitable partitions of association schemes. We try to generalize...
Partitions on a set are partially ordered by nesting: partition F is nested in partition G if every ...
Partitions on a set are partially ordered by nesting: partition F is nested in partition G if every ...
The well-known absolute bound condition for a primitive symmetric association scheme (X,S) gives an ...
AbstractThe theory of equitable partitions of graphs has a number of significant applications. We de...
AbstractPartitions on a set are partially ordered by nesting: partition F is nested in partition G i...
P(論文)"Let Ω = (X, {R_i}_) be commutative association scheme with class d. F_i, is a graph with respe...
We generalize the definition of distribution numbers of an association scheme (with symmetric classe...
We generalize the definition of distribution numbers of an association scheme (with symmetric classe...
Funding: The research of the first author was supported by an Undergraduate Research Bursary, number...
Abstract. Let (X,S) be an association scheme where X is a finite set and S is a partition of X × X. ...
AbstractIn this paper we will define the product of two association schemes and using the fact that ...
In January 1969, Peter M. Neumann wrote a paper entitled "Primitive permutation groups of degree 3p"...
In January 1969, Peter M. Neumann wrote a paper entitled "Primitive permutation groups of degree 3p"...
DOI
Add to ORKG