![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
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...
-
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...
-
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 ...