Article
Open Access
The number of edges of radius-invariant graphs
-
Ondrej Vacek
Published/Copyright:
March 13, 2009
Published Online: 2009-3-13
Published in Print: 2009-4-1
© 2009 Mathematical Institute, Slovak Academy of Sciences
Articles in the same Issue
- Classification of resolvable balanced incomplete block designs — the unitals on 28 points
- The inside outside intersection problem for hexagon triple systems
- A decomposition of (λK υ)+ with extended triangles
- An introduction to balanced sequential arrays on the square grid
- Goal-minimally k-elongated graphs
- The number of edges of radius-invariant graphs
- Iterative separation in distributive congruence lattices
- On a relative uniform completion of an archimedean lattice ordered group
- A note on the conditional probability of IF-events
Creative Commons
BY-NC-ND 3.0
Articles in the same Issue
- Classification of resolvable balanced incomplete block designs — the unitals on 28 points
- The inside outside intersection problem for hexagon triple systems
- A decomposition of (λK υ)+ with extended triangles
- An introduction to balanced sequential arrays on the square grid
- Goal-minimally k-elongated graphs
- The number of edges of radius-invariant graphs
- Iterative separation in distributive congruence lattices
- On a relative uniform completion of an archimedean lattice ordered group
- A note on the conditional probability of IF-events
