Coloração completa não-própria forte em grafos split
A strong complete non-proper coloring (SCNP coloring) of a graph 𝐺 is an assign ment of colors to the vertices of 𝐺 such that each possible combination of two colors (𝑐1, 𝑐2) is assigned to at least one pair of adjacent vertices of 𝐺, even when 𝑐1 = 𝑐2. The strong pseudoachromatic number of 𝐺 is the...
| Autor principal: | Correa, Aleff Renan Pereira |
|---|---|
| Formato: | Trabalho de Conclusão de Curso (Graduação) |
| Idioma: | Português |
| Publicado em: |
Universidade Tecnológica Federal do Paraná
2021
|
| Assuntos: | |
| Acesso em linha: |
http://repositorio.utfpr.edu.br/jspui/handle/1/26478 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|
| Resumo: |
A strong complete non-proper coloring (SCNP coloring) of a graph 𝐺 is an assign ment of colors to the vertices of 𝐺 such that each possible combination of two colors (𝑐1, 𝑐2) is assigned to at least one pair of adjacent vertices of 𝐺, even when 𝑐1 = 𝑐2. The strong pseudoachromatic number of 𝐺 is the maximum number of colors for which 𝐺 has a SCNP coloring. In this document, we determine the strong pseudoachromatic number of split graphs. |
|---|