HIGHLIGHTS
- who: Yingbin Ma and collaborators from the College of Mathematics and Information Science, Henan Normal University, Xinxiang, China have published the paper: Graphs with Strong Proper Connection Numbers and Large Cliques, in the Journal: Axioms 2023, 12, 353. of /2023/
- what: Next the authors investigate the rainbow connection number of a graph G of order n diam( G ) u2265 3 and u03c9 ( G ) = n - i for 2 6 i 6 3. The authors investigate graphs with a small (strong) proper connection number and a large clique number.
SUMMARY
Since diam( G . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.