Convexity in graphs

dc.contributor	Graduate Program in Mathematics.
dc.contributor.advisor	Ekim Aşıcı, Tınaz.
dc.contributor.advisor	Altok, Serdar.
dc.contributor.author	Erey, Aysel.
dc.date.accessioned	2023-03-16T11:21:37Z
dc.date.available	2023-03-16T11:21:37Z
dc.date.issued	2011.
dc.identifier.other	MATH 2011 E74
dc.identifier.uri	http://digitalarchive.boun.edu.tr/handle/123456789/15258
dc.description.abstract	The idea of finding analogies and generalizations to some concepts from continuous mathematics has led to the study of several new topics in discrete structures. Convexity is such a concept that has been widely studied in graphs during the last few decades. In this thesis, we focus on the notions of geodetic and hull sets. First, in Chapter 2, we survey a number of results concerning these two notions. In Chapter 3, we mainly deal with the computation of geodetic number in some special graph classes.
dc.format.extent	30cm.
dc.publisher	Thesis (M.S.)-Bogazici University. Institute for Graduate Studies in Science and Engineering, 2011.
dc.subject.lcsh	Convex domains.
dc.subject.lcsh	Graph theory.
dc.title	Convexity in graphs
dc.format.pages	ix, 49 leaves ;