Let D be a finite and simple digraph with vertex set V(D).The minimum degreeδof a digraph D is defined as the minimum value of its out-degrees and its in-degrees.If D is a digraph with minimum degreeδand edge-connec...Let D be a finite and simple digraph with vertex set V(D).The minimum degreeδof a digraph D is defined as the minimum value of its out-degrees and its in-degrees.If D is a digraph with minimum degreeδand edge-connectivity λ,then λ≤δ.A digraph is maximally edge-connected ifλ=δ.A digraph is called super-edge-connected if every minimum edge-cut consists of edges incident to or from a vertex of minimum degree.In this note we show that a digraph is maximally edge-connected or super-edge-connected if the number of arcs is large enough.展开更多
Define the zeroth-order Randic index R^(0)(G)=∑x∈V(G)1/√dG1(x),where dG(x)denotes the degree of the vertex x.In this paper,we present two sufficient conditions for graphs and triangle-free graphs to be super-edge-c...Define the zeroth-order Randic index R^(0)(G)=∑x∈V(G)1/√dG1(x),where dG(x)denotes the degree of the vertex x.In this paper,we present two sufficient conditions for graphs and triangle-free graphs to be super-edge-connected in terms of the zeroth-order Randic index,respectively.展开更多
文摘Let D be a finite and simple digraph with vertex set V(D).The minimum degreeδof a digraph D is defined as the minimum value of its out-degrees and its in-degrees.If D is a digraph with minimum degreeδand edge-connectivity λ,then λ≤δ.A digraph is maximally edge-connected ifλ=δ.A digraph is called super-edge-connected if every minimum edge-cut consists of edges incident to or from a vertex of minimum degree.In this note we show that a digraph is maximally edge-connected or super-edge-connected if the number of arcs is large enough.
基金This work is supported by the National Natural Science Foundation of China(Nos.11501490,61373019,13071107)the Natural Science Foundation of Shandong Province(No.ZR2015AM006).
文摘Define the zeroth-order Randic index R^(0)(G)=∑x∈V(G)1/√dG1(x),where dG(x)denotes the degree of the vertex x.In this paper,we present two sufficient conditions for graphs and triangle-free graphs to be super-edge-connected in terms of the zeroth-order Randic index,respectively.
