Learn More
All graphs G = (V(G), E(G)) considered are finite and simple. The number of vertices and the number of edges of G are denoted by n(G) and m(G), respectively; n(G) is the order of G. If u E V(G), we denote by N(v) the set of neighbows of z’. that is the set of those vertices to which u is adjacent. A k-verfex is a vertex of valency k; we also write p(u) = k.(More)
The Catania Research Group develops scientific researches mainly in Graph and Hypergraph Theory and Design Theory. These theories are of great interest not only for their contribution to Discrete Mathematics but also for their applications in Coding Theory, Statistics and Computer Science. The CRG participated in the international Panorama, not only for the(More)
  • 1