Note for the conjecture on the generalized 4-connectivity of total graphs of the complete bipartite graph
From MaRDI portal
Publication:6096357
DOI10.1016/j.amc.2023.128225OpenAlexW4385610223WikidataQ123163423 ScholiaQ123163423MaRDI QIDQ6096357
Publication date: 12 September 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2023.128225
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\)
- Internally disjoint trees in the line graph and total graph of the complete bipartite graph
- On minimally 2-connected graphs with generalized connectivity \(\kappa_3=2\)
- The generalized connectivity of complete equipartition 3-partite graphs
- On the generalized (edge-)connectivity of graphs
- Generalized Connectivity of Graphs
- The generalized connectivity of complete bipartite graphs
- Generalized connectivity of some total graphs
- The generalized 3-connectivity of random graphs
This page was built for publication: Note for the conjecture on the generalized 4-connectivity of total graphs of the complete bipartite graph