!!Research output per year
!!Research output per year
Project: RESEARCH PROJECT
In the paper we present lower bounds for the connectivity of a path graph P2(G) of a graph G. Let δ ⥠3 be the minimum degree of G. We prove that if G is a connected graph, then P2(G) is at least (δ-1)- connected; and if G is 2-connected, then P2(G) is at least (2δ-2)- connected. We remark that if G is a δ-regular graph then P2(G) is (2δ-2)-regular, and hence, if G is 2-connected then P2(G) is (2δ-2)-connected; its theoretical maximum.
| Status | Finished |
|---|---|
| Effective start/end date | 10/10/98 → 9/10/99 |
Research output: Contribution to journal › Article › peer-review
Research output: Contribution to journal › Article › peer-review
Research output: Contribution to journal › Article › peer-review