Event Title
The NGD-Circulant Graphs
Location
Session II, Virtual Room 2: Compounds, Graphs & Climate Change
Start Date
30-9-2020 3:00 PM
End Date
30-9-2020 3:55 PM
Participation Type
Poster
Description
Nordhaus and Gaddum showed that for any given graph the sum of its chromatic number and that of its complement cannot be greater than its order plus one. Recently, Collins and Trenk established an analogous result for the distinguishing chromatic number. In this talk, we present our investigation of the distinguishing chromatic number for a subclass of circulant graphs and their complements. We also discuss our characterization of the NGD-graphs for this particular class of graphs as well as our improvement of the upper bound given by Collins and Trenk.
The NGD-Circulant Graphs
Session II, Virtual Room 2: Compounds, Graphs & Climate Change
Nordhaus and Gaddum showed that for any given graph the sum of its chromatic number and that of its complement cannot be greater than its order plus one. Recently, Collins and Trenk established an analogous result for the distinguishing chromatic number. In this talk, we present our investigation of the distinguishing chromatic number for a subclass of circulant graphs and their complements. We also discuss our characterization of the NGD-graphs for this particular class of graphs as well as our improvement of the upper bound given by Collins and Trenk.
