# Search results for: Yuefang Sun

Applied Mathematics and Computation > 2018 > 337 > C > 14-24

_{u}denotes the degree of u ∈ V. Bollobás and Erdős (1998) generalized this index by replacing −12 with any fixed real number. To...

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 245-261

Discussiones Mathematicae Graph Theory > 2017 > 37 > 4 > 975-988

Applied Mathematics and Computation > 2017 > 311 > C > 223-227

Discussiones Mathematicae Graph Theory > 2017 > 37 > 3 > 623-632

Journal of Combinatorial Optimization > 2017 > 34 > 4 > 1012-1028

*G*, the anti-Ramsey number $$AR(K_n,G)$$ A R ( K n , G ) is defined to be the maximum number of colors in an edge-coloring of $$K_n$$ K n which does not contain any rainbow

*G*(i.e., all the edges of

*G*have distinct colors). The anti-Ramsey number was introduced by Erdős et al. (Infinite and finite sets, pp 657–665, 1973) and so far it has been determined for several...

Discussiones Mathematicae Graph Theory > 2017 > 37 > 1 > 141-154

Applied Mathematics and Computation > 2017 > 292 > C > 282-293

Discussiones Mathematicae Graph Theory > 2016 > 36 > 4 > 833-843

Discrete Applied Mathematics > 2015 > 194 > C > 171-177

Journal of Combinatorial Optimization > 2017 > 33 > 1 > 283-291

*k*-connectivity $$\kappa '_{k}(G)$$ κ k ′ ( G ) of a graph

*G*, introduced by Chartrand in 1984, is a generalization of the cut-version of the classical connectivity. Another generalized connectivity of a graph

*G*, named the generalized

*k*-connectivity $$\kappa _{k}(G)$$ κ k ( G ) , mentioned by Hager in 1985, is a natural generalization of the path-version of...

Bulletin of the Malaysian Mathematical Sciences Society > 2016 > 39 > 4 > 1673-1685

*k*-connectivity $$\kappa _{k}(G)$$ κ k ( G ) and the generalized

*k*-edge-connectivity $$\lambda _k(G)$$ λ k ( G ) of a graph

*G*, also known as the tree connectivities, were introduced by Hager (J Comb Theory Ser B 38:179–189, 1985) and Li et al. (Discret Math Theor Comput Sci 14:43–54, 2012), respectively. In this paper, we study these invariants for Cayley...

Czechoslovak Mathematical Journal > 2015 > 65 > 1 > 107-117

*k*-connectivity

*κ*

_{ k }(

*G*) of a graph

*G*was introduced by Chartrand et al. in 1984. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized

*k*-edge-connectivity which is defined as

*λ*

_{ k }(

*G*) = min{

*λ*...

Graphs and Combinatorics > 2014 > 30 > 4 > 949-955

*G*, where adjacent edges may have the same color, is

*rainbow connected*if every two vertices of

*G*are connected by a path whose edges have distinct colors. A graph

*G*is

*d-rainbow connected*if one can use

*d*colors to make

*G*rainbow connected. For integers

*n*and

*d*let

*t*(

*n, d*) denote the minimum size (number of edges) in

*d*-rainbow connected graphs of order

*n*. Schiermeyer got some...

Graphs and Combinatorics > 2013 > 29 > 1 > 1-38

*k*...

Graphs and Combinatorics > 2012 > 28 > 2 > 251-263

*G*, where adjacent edges may be colored the same, is called a rainbow path if no two edges of it are colored the same. A nontrivial connected graph

*G*is rainbow connected if for any two vertices of

*G*there is a rainbow path connecting them. The rainbow connection number of

*G*, denoted

*rc*(

*G*), is defined as the smallest number of colors such that

*G*is rainbow connected...

Plant Cell, Tissue and Organ Culture (PCTOC) > 2008 > 93 > 1 > 21-27