Skip to main content

3 Result(s)

within WeiHua Yang Remove this filter Applications of Mathematics Remove this filter

and

  1. No Access

    Article

    Properties of Chip-Firing Games on Complete Graphs

    Björner, Lovász and Shor introduced a chip-firing game on a finite graph \(G\) ...

    Wei Zhuang, Weihua Yang, Lianzhu Zhang… in Bulletin of the Malaysian Mathematical Sci… (2015)

  2. 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)

  3. No Access

    Article

    Non-Hamiltonian Graphs with Large Minimum Degree

    An n-vertex graph G is called Hamiltonian if it contains a cycle of length n. Denote by \(\delta (G)\) ...

    Lingting Fu, Liqing Gao, Jian Wang… in Bulletin of the Malaysian Mathematical Sci… (2023)