On the edge-connectivity and restricted edge-connectivity of a product of graphs (Q2462383)

From MaRDI portal
Revision as of 12:44, 27 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the edge-connectivity and restricted edge-connectivity of a product of graphs
scientific article

    Statements

    On the edge-connectivity and restricted edge-connectivity of a product of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 November 2007
    0 references
    The paper considers the product graphs introduced by Bermond et al. as a natural generalization of permutation graphs. The authors provide bounds for the two parameters, edge-connectivity and restricted edge-connectivity. Sufficient conditions are presented to guarantee optimal values of these parameters for product graphs. The results are compared with other previous results for the connectivity of permutation graphs and Cartesian product graphs.
    0 references
    edge-connectivity
    0 references
    restricted edge-connectivity
    0 references
    permutation graphs
    0 references
    Cartesian product.
    0 references

    Identifiers