شماره مدرك :
4841
شماره راهنما :
265 دكتري
پديد آورنده :
قاسمي مباركه، لاله
عنوان :

ساخت داربست نانو الياف جهت مهندسي بافت سلولهاي عصبي

مقطع تحصيلي :
كارشناسي ارشد
گرايش تحصيلي :
نساجي
محل تحصيل :
اصفهان: دانشگاه صنعتي اصفهان، دانشكده نساجي
سال دفاع :
1388
صفحه شمار :
يازده،199ص.:مصور،جدول،نمودار
يادداشت :
ص.ع.به فارسي و انگليسي
استاد راهنما :
محمد مرشد،محمد حسين نصر اصفهاني
استاد مشاور :
علي زادهوش،داريوش سمناني
توصيفگر ها :
پلي كاپرولاكتون , بهبود خواص
تاريخ نمايه سازي :
21/9/88
استاد داور :
امان ا... امين زاده، شهناز رضوي، سعيد كرباسي
دانشكده :
مهندسي نساجي
كد ايرانداك :
ID265 دكتري
چكيده فارسي :
به فارسي و انگليسي: قابل رويت در نسخه ديجيتالي
چكيده انگليسي :
Star Edge Coloring of Graphs Marzieh Vahid Dastjerdi m vahiddastjerdi@math iut ac ir September 16 2015 Department of Mathematical Sciences Isfahan University of Technology Isfahan 84156 83111 Iran Supervisor Dr Behnaz Omoomi bomoomi@cc iut ac ir Advisor Dr Ramin Javadi rjavadi@cc iut ac ir 2010 MSC 05C15 Keywords Star edge coloring Vertex distinguishing star edge coloring Strong edge coloring Abstract A star edge coloring of a graph G is a proper edge coloring where at least three distinct colors are used on the edges of every path and cycle of length four i e there is neither bichromatic path nor cycle of length four The star chromatic index of G denoted by G is the minimum number of s colors in a star edge coloring of G In 1973 Gr nbaum 23 rst proposed the concept of star coloring and star chromatic number Based on these conclusions star edge coloring was introduced in 2007 by Liu and Deng 29 In 2013 Dvo k Mohar and mal 15 obtained a near linear upper bound for the star chromatic index in terms of the maximum degree Also they determined upper and lower bounds for star chromatic index of complete graphs and subcubic graphs Recently Bezegov and et al 8 determine a tight star chromatic index of subcubic outerplanar graphs and trees and an upper bound for star chromatic index of outerplanar graphs This thesis contain a survey on the results of star edge coloring and other edge colorings that are closely related to it such as vertex distinguishing star edge coloring and strong edge coloring The contents of chapters are as follows In Chapter 1 we study a brief history of the graph coloring and all kinds of coloring that lead to the star edge coloring In Chapter 2 we investigate the concept of star edge coloring of graphs Also we study the available results about star chromatic index for complete graphs subcubic graphs trees and outerplanar graphs
استاد راهنما :
محمد مرشد،محمد حسين نصر اصفهاني
استاد مشاور :
علي زادهوش،داريوش سمناني
استاد داور :
امان ا... امين زاده، شهناز رضوي، سعيد كرباسي
لينک به اين مدرک :

بازگشت