Jui-Chia Wu

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper, we discuss many properties of graphs of Matching Composition Networks (MCN) [16]. A graph in MCN is obtained from the disjoint union of two graphs G0 and G1 by adding a perfect matching between V(G0) and V(G1). We prove that any graph in MCN preserves the hamiltonian connectivity or hamiltonian laceability, and pancyc-licity of G0 and G1(More)
  • 1