4 citations · 12 across the 17 of their papers we have counts for
4 papers · 1 filter
Automorphism Groups and Structure of 4-Valent Cayley Graphs on Dihedral Groups
Amitayu Banerjee
Let be a finite group and let be an inverse-closed subset of not containing the identity. The Cayley graph has vertex set , where two vertices $x…
The List-distinguishing chromatic number of graphs containing only small complete bigraphs
Amitayu Banerjee
In 2006, Collins and Trenk obtained a general sharp upper bound for the distinguishing chromatic number of a connected graph. Inspired by Catlin's combinatorial techniques from 197…
Automorphism groups and Distinguishing Colorings of Central and Middle Graphs
Amitayu Banerjee, Alexa Gopaulsingh, Zalán Molnár
Let G be a simple, finite, connected, and undirected graph. The middle graph M(G) of G is obtained from the subdivision graph S(G) after joining pairs of subdivided vertices that l…
On the Cost Number of Graphs with Determining Number Two
Alexa Gopaulsingh, Zalán Molnár, Amitayu Banerjee
A distinguishing vertex coloring of a graph is a vertex coloring such that only the identity automorphism of preserves the coloring. A graph is -distinguishable if it ad…