Skip to main navigation Skip to search Skip to main content

METRIC PROPERTIES OF PATH GRAPHS

Project: RESEARCH PROJECT

Project Details

Description

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.

StatusFinished
Effective start/end date10/10/98 → 9/10/99

Keywords

  • graph
  • network
  • distance
  • diameter

Fingerprint

Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.
  • Connectivity of path graphs

    Knor, M., Niepel, L. & Malah, M., 2002, In: Australasian Journal of Combinatorics. 25, p. 175-184 10 p.

    Research output: Contribution to journal › Article › peer-review

    11 Scopus citations
  • Diameter in iterated path graphs

    Knor, M. & Niepel, L., 28 Apr 2001, In: Discrete Mathematics. 233, 1-3, p. 151-161 11 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    11 Scopus citations
  • Path, Trail and Walk Graphs

    LUDOVIT NIEPEL, L. & MARTIN KNOR, 1999, In: Universitas Comeniana. Acta Mathematica.

    Research output: Contribution to journal › Article › peer-review