Código QR (código de barras bidimensional)

Modular colorings of join of two special graphs

For k≥2, a modular k-coloring of a graph G without isolated vertices is a coloring of the vertices of G with the elements in Zk having the property that for every two adjacent vertices of G, the sums of the colors of their neighbors are different in Zk. The minimum k for which G has a modular k-colo...

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Principais autores: N Paramaguru, R Sampathkumar
Formato: Artigo
Idioma:Inglês
Publicado em: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2014-10-01
coleção:Electronic Journal of Graph Theory and Applications
Assuntos:
Acesso em linha:http://www.ejgta.org/index.php/ejgta/article/view/28
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!