Open AccessConnectivity of path graphs
Author(s) -
Martin Knor,
Ľudovít Niepel
Publication year - 2000
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1118
Subject(s) - mathematics , combinatorics , path (computing) , discrete mathematics , computer science , programming language
In the paper we present lower bounds for the connectivity of a path graph P2(G) of a graph G.L etδ ≥ 3 be the minimum degree of G.W e prove that if G is a connected graph, then P2(G )i s at least (δ−1)- connected; and if G is 2-connected, then P2(G )i s at least (2δ−2)- connected. We remark that if G is a δ-regular graph then P2(G )i s (2δ−2)-regular, and hence, if G is 2-connected then P2(G )i s (2δ−2)- connected; its theoretical maximum.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom