Some results on the total proper k-connection number
In this paper, we first investigate the total proper connection number of a graph GG according to some constraints of G¯\overline{G}. Next, we investigate the total proper connection numbers of graph GG with large clique number ω(G)=n−s\omega \left(G)=n-s for 1≤s≤31\le s\le 3. Finally, we determine...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2022-04-01
|
| Series: | Open Mathematics |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/math-2022-0025 |