76 research outputs found
On strong rainbow connection number
A path in an edge-colored graph, where adjacent edges may be colored the
same, is a rainbow path if no two edges of it are colored the same. For any two
vertices and of , a rainbow geodesic in is a rainbow
path of length , where is the distance between and .
The graph is strongly rainbow connected if there exists a rainbow
geodesic for any two vertices and in . The strong rainbow connection
number of , denoted , is the minimum number of colors that are
needed in order to make strong rainbow connected. In this paper, we first
investigate the graphs with large strong rainbow connection numbers. Chartrand
et al. obtained that is a tree if and only if , we will show that
, so is not a tree if and only if , where
is the number of edge of . Furthermore, we characterize the graphs
with . We next give a sharp upper bound for according to
the number of edge-disjoint triangles in graph , and give a necessary and
sufficient condition for the equality.Comment: 16 page
Research on the Employment-oriented College English Teaching Reform in Medical Colleges
In order to meet the increasing demand of our society for inter-disciplinary talents (people who have got training in more than one professional field and do excellent in them), English teaching activities of medical schools in China should be employment-oriented, and the new teaching method should be found out to achieve the goal of talent training. Guided by the concept of employment-oriented education and after analyzing the problems existing in present college English teaching , this essay did a research on the reform of the employment-oriented college English teaching in medical colleges and universities.Β Β
- β¦