Report copyright - Teoria dos Grafos Loana T. Nogueira Aula 5. Conectividade: (G) Menor numero de vertices necessarios para desconectar G Se G eh completo, definimos (G)=n-1
Please pass captcha verification before submit form
Please pass captcha verification before submit form