BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1113
DTSTAMP:20230914T125951Z
SUMMARY:An Introduction to Chordal Graphs And Clique Trees
DESCRIPTION:Speaker: Vidya Sagar Sharma\n\nAbstract: \nAn undirected graph
is chordal if every cycle of length greater than three has a chord: namely
\, an edge connecting two nonconsecutive vertices on the cycle. A clique
of a graph $G$ is any maximal set of vertices that is complete in $G$.
Let $G$ be a chordal graph and $K_G = \\{ K_1\, K_2\, ...\, K_m \\}$ den
otes the set containing the cliques of $G$\, then a tree with vertex set $
K_G$ is said to be a clique tree of the chordal graph $G$ if it follows th
e clique intersection property: For every pair of distinct cliques $K\,K'
\\in K_G$\, the set $K \\cap K'$ is contained in every clique on the path
connecting $K$ and $K'$ in the tree.\n\nIn this talk\, we will see a few p
roperties of the chordal graphs and the clique trees of the chordal graphs
.\nReference: link.springer.com/content/pdf/10.1007%2F978-1-4613-8369-7_1.
pdf\n\nZoom Link : https://zoom.us/j/98132227553?pwd=K2cyQllKVjExdUhlRm0vc
0ZHcEt0Zz09\n
URL:https://www.tcs.tifr.res.in/web/events/1113
DTSTART;TZID=Asia/Kolkata:20210130T171500
DTEND;TZID=Asia/Kolkata:20210130T181500
END:VEVENT
END:VCALENDAR