10243

9461

كارشناسي ارشد

رياضي كاربردي

اصفهان: دانشگاه صنعتي اصفهان، دانشكده علوم رياضي

1393

نه، [79]ص.: مصور، جدول

ص.ع. به فارسي و انگليسي

بهناز عمومي، ميثم اكبرزاده

محمدحسين منشئي

23/3/94

غلامرضا اميدي، حسين حق شناس

1396/10/02

كتابنامه

علوم رياضي

رياضي

ID9461

Domination Set in Graph and Facilities Allocation in Trasportation Nasrin Mohamad Soltani soltani n0@gmail com 2015 Department of Mathematical Sciences Isfahan University of Technology Isfahan 84156 83111 Iran Supervisor Dr Behnaz Omoomi and Dr Meisam Akbarzadeh bomoomi@cc iut ac ir andmakbarzadeh@cc iut ac ir Advisor Dr Mohammad Hossein Manshae manshae@cc iut ac ir 2010 MSC 05C20 05C21 05C22 Keywords weighted graph vertex coloring edge weighting AbstractNowadays graph theory is one of the most popular mathematics and computer science branches Moreover because of wide applications graph theory is used for solving many problems in largemodern societies A subset S of vertices in graph G is called a domination set if each vertex in G isin S or has at least one neighbor in S This concept has a lot of application and research attractionand many studies have been done on it Facilities allocation with the least budget by considering the whole regions is one of the importantproblem in transportation schematization This thesis applies the concept of domination to locatingthe facilities stations for the city of Isfahan For this purpose the main street intersections in the mapof Isfahan city are considered as the vertices and the main streets as edges Afterward one algorithmis given to nd a domination set with minimum size in the obtained graph The obtained dominatingset could be used for locating the facilities stations such as public parking police stations and bicyclestations etc In particular since bicycle is a kind of safe and clean public transportation system thepresent study results is proposed to use for allocating the bicycle sharing stations in the Isfahan city

بهناز عمومي، ميثم اكبرزاده

محمدحسين منشئي

غلامرضا اميدي، حسين حق شناس