Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection

Permanent URI for this collectionhttps://hdl.handle.net/11147/7148

Browse

Filters

2004 - 200912010 - 20121

Settings

Institution Author: search.filters.institutionAuthor.Beşeri Sevim, TinaSubject: search.filters.subject.Graph theory

Search Results

Now showing 1 - 2 of 2
  • Conference Object
    Citation - Scopus: 7
    New 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şen
    In 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: 1
    Graph Coloring With Webmathematica
    (Springer Verlag, 2004) Ufuktepe, Ünal; Bacak, Gökşen; Beşeri Sevim, Tina
    Coloring 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.