Let G be a graph with odd edge-connectivity r. It is proved in this paper that if r > 3, then G has a 3-cycle (1, 2)-cover of total length at most ((r + 1)|E(G)|)/r . © 2005 Elsevier B.V. All rights reserved.

We completely describe the structure of the connected components of transversals to a collection of n arbitrary line segments in R. We show that n 3 line segments in R admit 0, 1, . . . , n or infinitely many line transversals. In the latter case, the transversals form up to n connected components.

Article history: Received 27 March 2008 Received in revised form 2 September 2008 Accepted 20 October 2008

Past research provides instructive yet incomplete answers as to how incumbent firms can address competing concerns as they embrace digital innovation. This research offers only partial explanations of why different concerns emerge, how they manifest, and how firms can manage them. In response, we present a longitudinal case study of Volvo Car’s connected car initiative. Combining extant literat...

The fundamental group of a hyperbolic manifold acts on the limit set, giving rise to a cross-product C∗-algebra. We construct nontrivial K-cycles for the cross-product algebra, thereby extending some results of Connes and Sullivan to higher dimensions. We also show how the Patterson-Sullivan measure on the limit set can be interpreted as a center-valued KMS state.

Among social network sites (SNS), Instagram has become one of the most important platforms for adolescents (age 10–19 years), especially in Germany. They use it to share experiences and meaningful content above all, interact with their peers. Norms, defined by peer group, influence adolescents’ behavior, online as much offline. This on aligning one’s needs expectations SNS environment leads pre...