A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs (Q5878427): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.21136/cmj.2022.0057-22 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4313224727 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Pendant tree-connectivity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4386304 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The generalized 3-connectivity of Lexicographic product graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Generalized Connectivity of Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4869540 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2931463 / rank | |||
Normal rank | |||
Latest revision as of 13:00, 31 July 2024
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
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
