A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs (Q5878427)

From MaRDI portal
Revision as of 05:56, 7 March 2024 by Import240305080351 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 7655765
Language Label Description Also known as
English
A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs
scientific article; zbMATH DE number 7655765

    Statements

    A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs (English)
    0 references
    0 references
    0 references
    0 references
    21 February 2023
    0 references
    connectivity
    0 references
    Steiner tree
    0 references
    internally disjoint Steiner tree
    0 references
    packing
    0 references
    pendant tree-connectivity
    0 references
    lexicographic product
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references