Zero Forcing And Maximum Nullity Of Graphs

الموضوعات

علوم بحتة وطبيعية

الملخص

The zero forcing game on a simple, undirected graph G is based on the so-called color change rule which can be stated as if some vertices on G are colored black while others are white and vertex v is a black vertex with exactly one white neighbor u, then change the color of vertex u to be black vertex. A zero forcing set is a subset of black vertices such that if we apply the color change rule, we have all vertices on G are black vertices. A new parameter so-called zero forcing number Z(G) which is the minimum size of azero forcing set among all zero forcing sets of G. The maximum nullity M(G) of a graphG is to determine the largest nullity over all symmetric matrices whose (i, j)th entry,i 6= j, is nonzero when {i, j} are connected with an edge in G and is zero otherwise. The zero forcing number Z(G) is helpful to study the M(G). Indeed, it is shown that Z(G)is upper bound on M(G). We conclude this thesis by studying the maximum nullity of symmetric matrices that represent of trees with a fixed number of negative eigen values.

روابط وملفات

التعريف والنوع

رقم الوثيقة

056e0084-c112-46d1-bfa9-1d49f6117498

رقم العقد

0

نوع الوسائط

Crawler

نوع المحتوى

الرسائل العلمية

صيغة المصدر

رسائل ماجيستير

نوع الملف

pdf text

أسماء الملفات

852563_1.pdf

بيانات النشر

ألقاب المؤلفين

[{"name_ar":"Hadil Abughiyatha","title_ar":"اعداد","title_en":"Preparation"},{"name_ar":"Mohammad Adam","title_ar":"اشراف","title_en":"Supervision"}]

اللغة

English

المصدر والدورية

اسم المصدر

Zero Forcing And Maximum Nullity Of Graphs

المحتوى والصفحات

عدد الصفحات

0

كلمات الباحثين

Graphs Zero Forcing Maximum Nullity

إشراف وإعداد

الإشراف

Mohammad Adam

الإعداد

Hadil Abughiyatha

الاقتباسات الببليوغرافية