Author
Yuefang Sun
Other affiliations: Ningbo University, Nankai University
Bio: Yuefang Sun is an academic researcher from Shaoxing University. The author has contributed to research in topics: Mathematics & Line graph. The author has an hindex of 15, co-authored 60 publications receiving 1144 citations. Previous affiliations of Yuefang Sun include Ningbo University & Nankai University.
Topics: Mathematics, Line graph, Computer science, Bound graph, Graph power
Papers
More filters
Posted Content•
TL;DR: The concept of Rainbow Connection was introduced by Chartrand et al. in 2008 as discussed by the authors, and quite a lot papers have been published about it, and a survey of the results and papers that dealt with it can be found here.
Abstract: The concept of rainbow connection was introduced by Chartrand et al. in 2008. It is fairly interesting and recently quite a lot papers have been published about it. In this survey we attempt to bring together most of the results and papers that dealt with it. We begin with an introduction, and then try to organize the work into five categories, including (strong) rainbow connection number, rainbow $k$-connectivity, $k$-rainbow index, rainbow vertex-connection number, algorithms and computational complexity. This survey also contains some conjectures, open problems or questions.
223 citations
Book•
23 Feb 2012
TL;DR: This chapter discusses the motivation and definitions for rainbow connection number, and some graph classes, for dense and sparse graphs, and graph operations, an upper bound for strong Rainbow connection number.
Abstract: 1. Introduction (Motivation and definitions, Terminology and notations).- 2. (Strong) Rainbow connection number(Basic results, Upper bounds for rainbow connection number, For some graph classes, For dense and sparse graphs, For graph operations, An upper bound for strong rainbow connection number).- 3. Rainbow k-connectivity.- 4. k-rainbow index.- 5. Rainbow vertex-connection number.- 6. Algorithms and computational complexity.- References.
215 citations
TL;DR: This survey attempts to bring together most of the results and papers that dealt with the concept of rainbow connection, including (strong) rainbow connection number, rainbow k-connectivity, k-rainbow index, rainbow vertex-connection number, algorithms and computational complexity.
Abstract: The concept of rainbow connection was introduced by Chartrand et al. [14] in 2008. It is interesting and recently quite a lot papers have been published about it. In this survey we attempt to bring together most of the results and papers that dealt with it. We begin with an introduction, and then try to organize the work into five categories, including (strong) rainbow connection number, rainbow k-connectivity, k-rainbow index, rainbow vertex-connection number, algorithms and computational complexity. This survey also contains some conjectures, open problems and questions.
207 citations
18 Aug 2017
TL;DR: This survey attempts to bring together most of the new results and papers that deal with the concept of rainbow connection in graph theory, and tries to organize the work into the following categories.
Abstract: The concept of rainbow connection was introduced by Chartrand, Johns, McKeon and Zhang in 2008. Nowadays it has become a new and active subject in graph theory. There is a book on this topic by Li and Sun in 2012, and a survey paper by Li, Shi and Sun in 2013. More and more researchers are working in this field, and many new papers have been published in journals. In this survey we attempt to bring together most of the new results and papers that deal with this topic. We begin with an introduction, and then try to organize the work into the following categories, rainbow connection coloring of edge-version, rainbow connection coloring of vertex-version, rainbow k-connectivity, rainbow index, rainbow connection coloring of total-version, rainbow connection on digraphs, rainbow connection on hypergraphs. This survey also contains some conjectures, open problems and questions for further study.
54 citations
Posted Content•
TL;DR: It is obtained that $\lambda(G)-1\leq \lambda_3(G)$ if $G$ is a connected planar graph, and the relation between the generalized3-connectivity and generalized 3-edge-Connectivity of a graph and its line graph is studied.
Abstract: The generalized $k$-connectivity $\kappa_k(G)$ of a graph $G$ was introduced by Chartrand et al. in 1984. It is natural to introduce the concept of generalized $k$-edge-connectivity $\lambda_k(G)$. For general $k$, the generalized $k$-edge-connectivity of a complete graph is obtained. For $k\geq 3$, tight upper and lower bounds of $\kappa_k(G)$ and $\lambda_k(G)$ are given for a connected graph $G$ of order $n$, that is, $1\leq \kappa_k(G)\leq n-\lceil\frac{k}{2}\rceil$ and $1\leq \lambda_k(G)\leq n-\lceil\frac{k}{2}\rceil$. Graphs of order $n$ such that $\kappa_k(G)=n-\lceil\frac{k}{2}\rceil$ and $\lambda_k(G)=n-\lceil\frac{k}{2}\rceil$ are characterized, respectively. Nordhaus-Gaddum-type results for the generalized $k$-connectivity are also obtained. For $k=3$, we study the relation between the edge-connectivity and the generalized 3-edge-connectivity of a graph. Upper and lower bounds of $\lambda_3(G)$ for a graph $G$ in terms of the edge-connectivity $\lambda$ of $G$ are obtained, that is, $\frac{3\lambda-2}{4}\leq \lambda_3(G)\leq \lambda$, and two graph classes are given showing that the upper and lower bounds are tight. From these bounds, we obtain that $\lambda(G)-1\leq \lambda_3(G)\leq \lambda(G)$ if $G$ is a connected planar graph, and the relation between the generalized 3-connectivity and generalized 3-edge-connectivity of a graph and its line graph.
52 citations
Cited by
More filters
[...]
TL;DR: Some of the major results in random graphs and some of the more challenging open problems are reviewed, including those related to the WWW.
Abstract: We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.
7,116 citations
Posted Content•
TL;DR: The concept of Rainbow Connection was introduced by Chartrand et al. in 2008 as discussed by the authors, and quite a lot papers have been published about it, and a survey of the results and papers that dealt with it can be found here.
Abstract: The concept of rainbow connection was introduced by Chartrand et al. in 2008. It is fairly interesting and recently quite a lot papers have been published about it. In this survey we attempt to bring together most of the results and papers that dealt with it. We begin with an introduction, and then try to organize the work into five categories, including (strong) rainbow connection number, rainbow $k$-connectivity, $k$-rainbow index, rainbow vertex-connection number, algorithms and computational complexity. This survey also contains some conjectures, open problems or questions.
223 citations
TL;DR: This survey attempts to bring together most of the results and papers that dealt with the concept of rainbow connection, including (strong) rainbow connection number, rainbow k-connectivity, k-rainbow index, rainbow vertex-connection number, algorithms and computational complexity.
Abstract: The concept of rainbow connection was introduced by Chartrand et al. [14] in 2008. It is interesting and recently quite a lot papers have been published about it. In this survey we attempt to bring together most of the results and papers that dealt with it. We begin with an introduction, and then try to organize the work into five categories, including (strong) rainbow connection number, rainbow k-connectivity, k-rainbow index, rainbow vertex-connection number, algorithms and computational complexity. This survey also contains some conjectures, open problems and questions.
207 citations
Journal Article•
TL;DR: It is shown that, for each fixed $k$, the problem of finding pairwise vertex-disjoint directed paths between given pairs of terminals in a directed planar graph is solvable in polynomial time.
Abstract: It is shown that, for each fixed $k$, the problem of finding $k$ pairwise vertex-disjoint directed paths between given pairs of terminals in a directed planar graph is solvable in polynomial time.
87 citations
TL;DR: It is shown that rvc (G) ≤ 3n/(δ+1)+5 for [xxx] and n ≥ 290, while rvc(G) ≥ 4n/( δ + 1) + 5 for [xx] and rvc(-G) = 4n/5 + C(δ) for 6 ≤ δ ≤ 15, where [xxx].
Abstract: A vertex-colored graph is rainbow vertex-connected if any two vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex-connection of a connected graph G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertexconnected. It was proved that if G is a graph of order n with minimum degree δ, then rvc(G) < 11n/δ. In this paper, we show that rvc(G) ≤ 3n/(δ+1)+5 for δ ≥ √ n − 1 − 1 and n ≥ 290, while rvc(G) ≤ 4n/(δ + 1) + 5 for 16 ≤ δ ≤ √ n − 1 − 2 and rvc(G) ≤ 4n/(δ + 1) + C(δ) for 6 ≤ δ ≤ 15, where C(δ) = e 3 log(�3+2�2+3) 3(log 3 1) � 3 − 2. We also prove that rvc(G) ≤ 3n/4 − 2 for δ = 3, rvc(G) ≤ 3n/5 − 8/5 for δ = 4 and rvc(G) ≤ n/2 − 2 for δ = 5. Moreover, an example constructed by Caro et al. shows that when δ ≥ √ n − 1−1 and δ = 3,4,5, our bounds are seen to be tight up to additive constants.
61 citations