Polymer based electro-optic modulators have shown great potentials in high frequency analog optical links. Existing commercial LiNibO3 Mach-Zehnder modulators have intrinsic drawbacks in linearity to provide high fidelity communication. In this paper, we present the design, fabrication and characterization of a traveling wave directional coupler modulator based on electro-optic polymer, which i...

In this paper, we prove that all Cayley digraphs of valency 2 on nonabelian groups of odd square-free order are normal. For a given subset S of a finite group G without the identity element 1, the Cayley digraph on G with respect to S is denoted by r =Cay(G, S) where V(r) = G, E(r) = {(g, 8g) I 9 E G,8 E S}. It is clear that Aut (r), the automorphism group of r, contains the right regular repre...

Abstract The well-known -complete problem Matching Cut is to decide if a graph has matching that also an edge cut of the graph. We prove new complexity results for restricted H -free graphs, is, graphs do not contain some fixed as induced subgraph. two recently studied variants , on graphs. first variant requires must be extendable perfect second matching. In particular, we there exists small c...

We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M be a 2-edge-coloured complete multigraph. M. Bankfalvi and Zs. Bankfalvi [2] obtained a necessary and sufficient condition for G to have a Hamiltonian alternating cycle. Generalizing this theorem, P. Das and S.B. Rao [7]...

We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are defined, nondeterministic and alternating. We show that the nondeterministic automata have a decidable nonemptiness problem and leave as an open question whether this is true for the alternating version. The families o...