Mathematics / Matematik
Permanent URI for this collectionhttps://hdl.handle.net/11147/8
Browse
2 results
Search Results
Conference Object Citation - Scopus: 7New Mathematical Model for Finding Minimum Vertex Cut Set(Institute of Electrical and Electronics Engineers Inc., 2012) Beşeri Sevim, Tina; Kutucu, Hakan; Berberler, Murat ErşenIn this paper, we consider the vertex separator problem. Given an undirected graph G, the vertex separator problem consists in identifying a minimum number of vertex set whose removal disconnects G. We present a new mathematical model for solving this problem and also present computational results on graphs with various density. © 2012 IEEE.Article Citation - WoS: 1Graph Coloring With Webmathematica(Springer Verlag, 2004) Ufuktepe, Ünal; Bacak, Gökşen; Beşeri Sevim, TinaColoring of a graph is an assignment of colors either to the edges of the graph G, or to vertices, or to maps in such a way that adjacent edges/vertices/maps are colored differently. We consider the problem of coloring graphs by using webMathematica which is the new web-based technology. In this paper, we describe some web-based interactive examples on graph coloring with webMathematica.
