پديد آورنده :
بهتوني، علي
عنوان :
رنگ آميزي مكان ياب گراف ها
محل تحصيل :
اصفهان: دانشگاه صنعتي اصفهان، دانشكده علوم رياضي
صفحه شمار :
هفت،78ص.: مصور،جدول،نمودار
يادداشت :
ص.ع.به فارسي و انگليسي
استاد راهنما :
بهناز عمومي
استاد مشاور :
غلامرضا اميدي
تاريخ نمايه سازي :
1/8/91
استاد داور :
عبادا.. محموديان،حسين حاجي ابوالحسن، جواد باقريان
كد ايرانداك :
ID449 دكتري
چكيده فارسي :
به فارسي و انگليسي: قابل رويت در نسخه ديجيتالي
چكيده انگليسي :
The Locating Coloring of Graphs Ali Behtoei alibehtoei@math iut ac ir June 9 2012 Doctor of Philosophy Thesis Department of Mathematical Sciences Isfahan University of Technology Isfahan 84156 83111 IranSupervisor Dr Behnaz Omoomi bomoomi@cc iut ac ir Advisor Dr Golam Reza Omidi romidi@cc iut ac irDepartment Graduate Program Coordinator Dr Golam Reza Omidi romidi@cc iut ac ir Department of Mathematical Sciences Isfahan University of Technology Isfahan 84156 83111 Iran AbstractLet f be a proper k coloring of a connected graph G and V1 V2 Vk be an orderedpartition of V G into the resulting color classes For a vertex v of G the color code of vwith respect to is de ned to be the ordered k tuple c v d v V1 d v V2 d v Vk where d v Vi min d v x x Vi 1 i k If distinct vertices have distinct colorcodes then f is called a locating coloring The locating chromatic number of G denoted by L G is the minimum number of colors needed in a locating coloring of G In this thesis we study the locating chromatic number of Kneser graphs Cartesian product of graphs andthe join of graphs Keywords Locating coloring Kneser graph Cartesian product Join operation Mathematics Subject Classi cation 2010 05C151 IntroductionLet G be a graph without loops and multiple edges with vertex set V G and edge set E G A proper k coloring of G k N is a function f de ned from V G onto a set of colors k 1 2 k such that every two adjacent vertices have di erent colors In fact forevery i 1 i k the set f 1 i is a nonempty independent set of vertices which is calledthe color class i When S V G then f S f u u S The minimum cardinalityk for which G has a proper k coloring is the chromatic number of G denoted by G For aconnected graph G the distance d u v between two vertices u and v in G is the length of ashortest path between them and for a subset S of V G the distance between u and S is givenby d u S min d u x x S The diameter of G is max d u v u v V G Whenu is a vertex of G then the neighbor of u in G is the set NG u v v V G d u v 1 1
استاد راهنما :
بهناز عمومي
استاد مشاور :
غلامرضا اميدي
استاد داور :
عبادا.. محموديان،حسين حاجي ابوالحسن، جواد باقريان
