Yaping Mao
Published 2016-03-13Version 1
Dirac showed that in a $(k-1)$-connected graph there is a path through each $k$ vertices. The path $k$-connectivity $\pi_k(G)$ of a graph $G$, which is a generalization of Dirac's notion, was introduced by Hager in 1986. In this paper, we study path connectivity of line graphs.
Comments: 15 pages. arXiv admin note: substantial text overlap with arXiv:1508.07202, arXiv:1207.1838; text overlap with arXiv:1103.6095 by other authors
Distance and distance signless Laplacian spread of connected graphs
A partition of connected graphs
Rainbow connection in $3$-connected graphs
![QR code for arXiv:1603.03995 [math.CO]](http://oss.arxitics.com/images/favicon.svg)