Skip to main content

and
  1. No Access

    Article

    Super-Edge-Connectivity and Zeroth-Order Randić Index

    Define the zeroth-order Randić index \(R^0(G)=\sum _{x\in V(G)}\frac{1}{\sqrt{d_G(x)}}\)R0(G)=∑x∈V(G)1dG(x), where \(d_G(x)\)dG(x) denotes the degree of the vertex x. In this paper, we present two sufficient cond...

    Zhi-Hong He, Mei Lu in Journal of the Operations Research Society of China (2019)

  2. No Access

    Article

    Super Edge-connectivity and Zeroth-order General Randić Index for −1 ≤ α < 0

    Let G be a connected graph with order n, minimum degree δ = δ(G) and edge-connectivity λ = λ(G). A graph G is maximally edge-connected if λ = δ, and super edge-connected if every minimum edgecut consists of edges...

    Zhi-hong He, Mei Lu in Acta Mathematicae Applicatae Sinica, English Series (2018)

  3. No Access

    Article

    Componentwise complementary cycles in multipartite tournaments

    The problem of complementary cycles in tournaments and bipartite tournaments was completely solved. However, the problem of complementary cycles in semicomplete n-partite digraphs with n ≥ 3 is still open. Based ...

    Zhi-hong He, Guo-jun Li in Acta Mathematicae Applicatae Sinica, English Series (2012)