Back to Search
Start Over
Note for the conjecture on the generalized 4-connectivity of total graphs of the complete bipartite graph.
- Source :
-
Applied Mathematics & Computation . Dec2023, Vol. 458, pN.PAG-N.PAG. 1p. - Publication Year :
- 2023
-
Abstract
- The generalized k -connectivity κ k (G) of a graph G , introduced by Hager in 1985, is a natural generalization of the concept of connectivity κ (G) , which is just for k = 2. Rongxia Hao et al. determined the generalized 4-connectivity of the total graphs of the complete equipartition bipartite graph and conjectured that κ 4 (T (K m , m + 1)) = 2 m − 1 and κ 4 (T (K m , n)) = 2 m for n > m + 1 and m ≥ 4 in [Appl. Math. Comput. 422 (2022)]. In this paper, we solved this conjecture. [ABSTRACT FROM AUTHOR]
- Subjects :
- *COMPLETE graphs
*BIPARTITE graphs
*LOGICAL prediction
*MATHEMATICS
Subjects
Details
- Language :
- English
- ISSN :
- 00963003
- Volume :
- 458
- Database :
- Academic Search Index
- Journal :
- Applied Mathematics & Computation
- Publication Type :
- Academic Journal
- Accession number :
- 169929634
- Full Text :
- https://doi.org/10.1016/j.amc.2023.128225