انت هنا الان : شبكة جامعة بابل > موقع الكلية > نظام التعليم الالكتروني > مشاهدة المحاضرة

# سعيات المرحلة الاولى لمادة الهياكل المتقطعة

الكلية كلية تكنولوجيا المعلومات     القسم قسم شبكات المعلومات     المرحلة 1
أستاذ المادة بهيجة خضير شكر الغانمي       10/05/2016 09:58:50
Maps & Regions
? A particular planar representation of a finite planar
multigraph is called a map. We say that the map is
connected if the underlying multigraph is connected.
? A given map divides the plane into various regions.
? By the degree of a region r, written deg(r), we mean the
length of the cycle or closed walk which borders r.
? The sum of the degrees of the
regions of a map is equal to twice
the number of edges
Department of Software 4
edges.
Graph Coloring
? A vertex coloring, or simply a coloring of G is an
assignment of colors to the vertices of G such that adjacent
vertices have different colors.
? We say that G is n-colorable if there exists a coloring of G
which
? The minimum number of colors needed to paint G is called
the chromatic number of G and is denoted by ?(G). uses n
colors.
Department of Software 5
Dual Maps & The Four Color Theorem
? Any planar graph is 4-colorable
Department of Software 6
Welch-Powell Coloring Algorithm
? .
Department of Software 7
Maps & Regions
? A particular planar representation of a finite planar
multigraph is called a map. We say that the map is
connected if the underlying multigraph is connected.
? A given map divides the plane into various regions.
? By the degree of a region r, written deg(r), we mean the
length of the cycle or closed walk which borders r.
? The sum of the degrees of the
regions of a map is equal to twice
the number of edges
Department of Software 4
edges.
Graph Coloring
? A vertex coloring, or simply a coloring of G is an
assignment of colors to the vertices of G such that adjacent
vertices have different colors.
? We say that G is n-colorable if there exists a coloring of G
which
? The minimum number of colors needed to paint G is called
the chromatic number of G and is denoted by ?(G). uses n
colors.
Department of Software 5
Dual Maps & The Four Color Theorem
? Any planar graph is 4-colorable
Department of Software 6
Welch-Powell Coloring Algorithm
? .
Department of Software 7
Maps & Regions
? A particular planar representation of a finite planar
multigraph is called a map. We say that the map is
connected if the underlying multigraph is connected.
? A given map divides the plane into various regions.
? By the degree of a region r, written deg(r), we mean the
length of the cycle or closed walk which borders r.
? The sum of the degrees of the
regions of a map is equal to twice
the number of edges
Department of Software 4
edges.
Graph Coloring
? A vertex coloring, or simply a coloring of G is an
assignment of colors to the vertices of G such that adjacent
vertices have different colors.
? We say that G is n-colorable if there exists a coloring of G
which
? The minimum number of colors needed to paint G is called
the chromatic number of G and is denoted by ?(G). uses n
colors.
Department of Software 5
Dual Maps & The Four Color Theorem
? Any planar graph is 4-colorable
Department of Software 6
Welch-Powell Coloring Algorithm
? .
Department of Software 7

المادة المعروضة اعلاه هي مدخل الى المحاضرة المرفوعة بواسطة استاذ(ة) المادة . وقد تبدو لك غير متكاملة . حيث يضع استاذ المادة في بعض الاحيان فقط الجزء الاول من المحاضرة من اجل الاطلاع على ما ستقوم بتحميله لاحقا . في نظام التعليم الالكتروني نوفر هذه الخدمة لكي نبقيك على اطلاع حول محتوى الملف الذي ستقوم بتحميله .