Lower and upper bound on defining spectrum of regular graphs

MaRDI QIDQ3092670zbMATH OpenFDO

Authors Eric Mendelsohn, Doost Ali Mojdeh

Publication date 20 September 2011

zbMATH Keywords

defining spectrumregular graphvertex coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• On the defining spectrum of k-regular graphs with k-1 colors
• On the extending ofk-regular graphs and their strong defining spectrum
• On the strong defining spectrum of k-regular graphs
• On defining numbers of vertex colouring of regular graphs
• On defining numbers of k-chromatic k-regular graphs.

Cited in

(2)

• On the strong defining spectrum of k-regular graphs
• On the defining spectrum of k-regular graphs with k-1 colors

This page was built for publication: Lower and upper bound on defining spectrum of regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3092670)