Article contents
The diameters of the graphs of semirings
Published online by Cambridge University Press: 09 April 2009
Extract
Let be a family of sets, {Fa|α∈Λ}. By the graph G of the system , we mean the graph whose set of vertices is and in which the vertices Fβ∈, are adjacent (that is, are joined by an edge) if and only if Fα ≠ Fβ and Fα ∩ Fβ □, where □denotes the empty set.
- Type
- Research Article
- Information
- Journal of the Australian Mathematical Society , Volume 11 , Issue 4 , November 1970 , pp. 433 - 440
- Copyright
- Copyright © Australian Mathematical Society 1970
References
- 3
- Cited by