عنوان :
تعميم هايي از گراف هاي قويا منظم
مقطع تحصيلي :
كارشناسي ارشد
گرايش تحصيلي :
رياضي كاربردي
محل تحصيل :
اصفهان: دانشگاه صنعتي اصفهان، دانشكده علوم رياضي
صفحه شمار :
هشت، 50ص.: مصور، جدول، نمودار
يادداشت :
ص.ع. به فارسي و انگليسي
استاد راهنما :
غلامرضا اميدي
استاد مشاور :
بهناز عمومي
توصيفگر ها :
گراف دزا , گراف تقسيم پذير طرحي , مجاور مشترك
تاريخ نمايه سازي :
24/8/91
استاد داور :
سعيد اكبري، ابراهيم قرباني
تاريخ ورود اطلاعات :
1396/09/21
چكيده فارسي :
به فارسي و انگليسي: قابل رويت در نسخه ديجيتالي
چكيده انگليسي :
Some Extensions of Strongly Regular Graphs Mohammad Rahbar m rahbar@math iut ac ir August 25 2012 Department of Mathematical Sciences Isfahan University of Technology Isfahan 84156 83111 Iran Supervisor Dr Gholam Reza Omidi romidi@cc iut ac ir Advisor Dr Behnaz Omoomi bomoomi@cc iut ac ir 2012 MSC 05C15 Keywords Strongly regular graph Deza graph Divisibel design graph graph Commonneighbor Abstract Let G be a graph which is neither empty nor complete Then G is said to be a strongly regulargraph SRG with parameters v k if G is a k regular graph on n vertices in which every pairof adjacent vertices has common neighbors and every pair of non adjacent vertices has commonneighbors One of the most important family of regular graphs is the family of strongly regular graphswhich has so many beautiful properties One of these well known properties is the fact that theeigenvalues of all SRGs depend only the parameters of these graphs There are many SRGs arisingfrom combinatorial concepts such as orthogonal arrays Latin squares conference matrices designsand geometric graphs In this thesis the following generalizations of strongly regular graphs has beenstudied A graph G is a Deza graph if it is regular and the number of common neighbors of two distinctvertices takes on one of two values not necessarily depending on the adjacency of the two vertices Haemers Erickson Fernando Hard and Hemmeter introduced several ways to construct Deza graphs and develop some basic theory They also gave list all diameter two Deza graphs which are not stronglyregular and have at most 13 vertices The Friendship Theorem states that if any two people in a party have exactly one common friend then there exists a politician who is a friend of everybody Let be any nonnegative integer and be any positive integer Suppose each pair of friends have exactly common friends and each pair
استاد راهنما :
غلامرضا اميدي
استاد مشاور :
بهناز عمومي
استاد داور :
سعيد اكبري، ابراهيم قرباني
