This paper presents a novel method for the element characterization of printed reflectarray antennas. Their characterization requires the calculation of the phase of the reflection coefficient versus the patch dimension (phase diagram), when the structure is illuminated by a uniform plane wave. The calculation of the phase diagram is based on the full–wave analysis of the structure in a limited...

Accurate delay calculation of circuit gates is very important in timing analysis of digital circuits. Waveform shapes on the input ports of logic gates should be considered, in the characterization phase of delay calculation, to obtain accurate gate delay values. Glitches and their temporal effect on circuit gate delays should be taken into account for this purpose. However, the explosive numbe...

.................................................................................................................................. iii CONTENTS ................................................................................................................................... vi 1 INTRODUCTION AND LITERATURE REVIEW ............................................................... 1 1.1 Introduct...

The paper presents a new proof of O’Cinneide’s characterization theorem [7]. It is much simpler than the original one and constructive in the sense that we not only show the existence of a phase type representation, but present a procedure which creates a phase type representation. We prove that the procedure succeeds when the conditions of the characterization theorem hold.

In this paper, we present characterizations of pairs of graphs whose join graphs are 2-minimally nonouterplanar. In addition, we present a characterization of pairs of graphs whose join graphs are 2-minimally nonouterplanar in terms of forbidden subgraphs.

For the family of graphs with xed-size vertex cover k, we present all of the forbidden minors (obstructions), for k up to ve. We derive some results, including a practical nite-state recognition algorithm, needed to compute these obstructions.

A graph G is coordinated if the minimum number of colors that can be assigned to the cliques of H in such a way that no two cliques with non-empty intersection receive the same color is equal to the maximum number of cliques of H with a common vertex, for every induced subgraph H of G. Coordinated graphs are a subclass of perfect graphs. The list of minimal forbidden induced subgraphs for the c...

In this paper, we prove that an element splitting operation by every pair of elements on a cographic matroid yields a cographic matroid if and only if it has no minor isomorphic to M(K4).

The G-width of a class of graphs G is defined as follows. A graph G has G-width k if there are k independent sets N1, . . . ,Nk in G such that G can be embedded into a graph H ∈ G such that for every edge e in H which is not an edge in G, there exists an i such that both endpoints of e are in Ni. For the class TH of threshold graphs we show that TH-width is NP-complete and we present fixed-para...

Given a class of graphs F , a forbidden subgraph characterization (FSC) is a set of graphs H such that a graph G belongs to F if and only if no graph of H is isomorphic to an induced subgraph of G. FSCs play a key role in graph theory, and are at the center of many important results obtained in that field. In this paper, we present novel methods that automate the generation of conjectures on FS...