تحت إشراف قسم الرياضيات والإحصاء وبالتعاون مع مركز البحوث بالكلية أقيم يوم الثلاثاء 16 / 3 / 1441هـ

سيمنار بعنوان :

A Generalization of Line Graphs

قدمته  د.خولة الحلوة وذلك في تمام الساعة 10.30 ص في قاعة الاجتماعات بكلية العلوم.

Abstract:

The line graph is one of the best-known derived graphs.  The line graph L(G) of a graph G is that graph whose vertices are the edges of G where two vertices of L(G) are adjacent if the corresponding edges of G are adjacent.  A characterization of those graphs G that are the line graph of some graph is due to Beineke.  This characterization determines those graphs that are forbidden to be a subgraph of G.   A characterization of graphs whose line graph is Hamiltonian is due to Harary and Nash-Williams.  Iterated line graphs of almost all connected graphs were shown to be Hamiltonian by Chartrand.