An equivalence graph is a vertex disjoint union of complete graphs. For a graph G, let eq(G) be the irdnimum number of equivalence subgraphs of G needed to cover all edges of G. Similarly, let cc(G) be the minimum number of complete subgraphs of G needed to cover all its edges. Let H be a graph on n vertices with ma,'dmal degree _~d (and minimal degree --~ 1), and let G=I~ be its complement. We...

Introduction Conclusions References Tables Figures ◭ ◮ ◭ ◮ Back Close Full Screen / Esc Abstract Introduction Conclusions References

Composable safety certification envisions reuse of safety case argument-fragments together with safety-relevant components in order to reduce the cost and time needed to achieve certification. The argumentfragments could cover safety aspects relevant for different contexts in which the component can be used. Creating argument-fragments for the out-of-context components is time-consuming and cur...

In this paper a schema of graphical parameters is proposed. Based on the parameter integrity introduced by Barefoot, Entringer and Swart, members Ψ(G) of this schema have the general form Ψ(G) = min{ |S| + ψ(G − S) : S ⊂ V (G) }, where ψ(G) is another given graphical parameter. Examples include integrity, mean integrity, connectivity and vertex cover number. General results and bounds for the s...

We show that there exists a Martin-Löf random degree which has a strong minimal cover.

We show that contact reductions can be described in terms of symplectic the traditional Marsden-Weinstein-Meyer as well constant rank picture. The point is we view structures particular (homogeneous) structures. A group action by contactomorphisms lifted to a Hamiltonian on corresponding manifold, called cover manifold. In contrast majority literature subject, our approach includes general (not...