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

DOI10.21136/CMJ.2022.0057-22OpenAlexW4313224727MaRDI QIDQ5878427

Christopher Melekian, Eddie Cheng, Yaping Mao

Publication date: 21 February 2023

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.21136/cmj.2022.0057-22

zbMATH Keywords

packingconnectivitySteiner treelexicographic productpendant tree-connectivityinternally disjoint Steiner tree

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Pendant tree-connectivity
• Generalized Connectivity of Graphs
• The generalized 3-connectivity of Lexicographic product graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs