The notion of security index quantifies the least effort involved in conducting perfectly
undetectable attacks. Thus, the security index enables a systems operator to assess the …

Three well-studied types of subgraph-restricted matchings are induced matchings, uniquely
restricted matchings, and acyclic matchings. While it is hard to determine the maximum size …

A matching in a graph is uniquely restricted if no other matching covers exactly the same set
of vertices. This notion was defined by Golumbic, Hirst, and Lewenstein and studied in a …

A matching in a graph G is a set of pairwise disjoint edges of G. The matching number of G is
defined as the maximum cardinality of a matching in G. In this thesis I will present several …

A matching in a graph is uniquely restricted if no other matching covers exactly the same set
of vertices. This notion was defined by Golumbic, Hirst, and Lewenstein (2001) and studied …

This paper considers linear discrete-time network systems affected by unknown Inputs,
studying whether they are input and state observable (ISO), namely whether both the initial …

If G (M) denotes the subgraph of a graph G induced by the set of vertices that are covered by
some matching M in G, then M is an induced or a uniquely restricted matching if G (M) is 1 …

Abstract In Partition Into Complementary Subgraphs (Comp-Sub) we are given a graph
G=(V, E), and an edge set property Π, and asked whether G can be decomposed into two …

For a matching M in a graph G, let G (M) be the subgraph of G induced by the vertices of G
that are incident with an edge in M. The matching M is induced, if G (M) is 1-regular, and M is …

This thesis deals with the notion of Input and State Observability (ISO) in linear network
systems. One seeks graphical characterizations using the notion of structural (resp. s …