Skip to main content

3 Result(s)

within Article Remove this filter Meirun Chen Remove this filter

and

  1. No Access

    Article

    Diagnosability for a family of matching composition networks

    We study here the diagnosability of networks under two models of self-diagnosis: PMC model introduced by Preparata, Metze and Chien (IEEE Trans Electronic Computers 16(12):848–854 (1967)) and MM

    Meirun Chen, Michel Habib, Cheng-Kuan Lin in The Journal of Supercomputing (2023)

  2. No Access

    Article

    Graphs with Almost All Edges in Long Cycles

    For an edge e of a given graph G, define \(c_e(G)\) ...

    Naidan Ji, Meirun Chen in Graphs and Combinatorics (2018)

  3. No Access

    Article

    On Cyclic Edge-Connectivity and Super-Cyclic Edge-Connectivity of Double-Orbit Graphs

    A cyclic edge-cut of a graph G is an edge set, the removal of which separates two cycles. If G has a cyclic edge-cut, then it is said to be cyclically separable. For a cyclically separable graph G, the cyclic edg...

    Weihua Yang, Chengfu Qin, Meirun Chen in Bulletin of the Malaysian Mathematical Sci… (2016)