Time-7:15pm-8:15pm IST (roughly)*
Topic
In this talk, I will give a walkaround through the major ideas by Hall in 1900s regarding the locating dominating codes on planar graphs. We will see how properties of the planar graphs give a bound on the size of the graph provided it has a small locating dominating/identifying codes.
The venue for all the talks will be gmeet or zoom. The links will be changed|updated as and when required.
Note: The prospective speakers are arranged in the order in which they speak
Please find the updated link on the right--------->