Article
Licensed
Unlicensed
Requires Authentication
The intersection number of complete r-partite graphs
-
N. S. Bolshakova
Published/Copyright:
May 27, 2008
Abstract
Latin squares C, D of order n are called pseudo-orthogonal if any two rows of the matrices C and D have exactly one common element. We give conditions for existence of families consisting of t pseudo-orthogonal Latin squares of order n. It is proved that the intersection number of a complete r-partite graph 
equals n2 if and only if there exists a family consisting of r – 2 pairwise pseudo-orthogonal Latin squares of order n. It is proved that if 
, where prols(n) is the maximum t such that there exists a set of t pseudo-orthogonal Latin squares of order n, then the intersection number of the graph 
is equal to n2. Applications of the obtained results to calculating the intersection number of some graphs are given.
Received: 2005-04-19
Published Online: 2008-05-27
Published in Print: 2008-May
© de Gruyter 2008
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On approximation with given accuracy of functions of k-valued logic by polynomials
- On complexity of realisation of a class of almost symmetric functions by formulas of depth 3
- On complexity of linear operators on the class of circuits of depth 2
- On the complexity of decoding Boolean cube splitting into cube faces
- Some characteristics of dependencies in discrete random sequences
- On random 2-adjacent 0/1-polyhedra
- The intersection number of complete r-partite graphs
- On Mazurov triples of the sporadic group B and Hamiltonian cycles of the Cayley graph
- Malcev rings
Articles in the same Issue
- On approximation with given accuracy of functions of k-valued logic by polynomials
- On complexity of realisation of a class of almost symmetric functions by formulas of depth 3
- On complexity of linear operators on the class of circuits of depth 2
- On the complexity of decoding Boolean cube splitting into cube faces
- Some characteristics of dependencies in discrete random sequences
- On random 2-adjacent 0/1-polyhedra
- The intersection number of complete r-partite graphs
- On Mazurov triples of the sporadic group B and Hamiltonian cycles of the Cayley graph
- Malcev rings
