On the strong defining spectrum of k-regular graphs

Research

Title	On the strong defining spectrum of k-regular graphs
Type	JournalPaper
Keywords	Regular graphs, coloring, defining spectrum
Year	2008
Journal	Italian Journal of Pure and Applied Mathematics
DOI
Researchers	Doost Ali Mojdeh

Abstract

A strong defining. vertices and be colored with k-1 colors. We study the family F with k=5 or k=6 colors is the strong defining number, denoted by sd(G,c). Let F be a family of k-regular graphs on n

Doost Ali Mojdeh

Research

Abstract