Mathematics / Matematik

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

Browse

Filters

2004 - 200932010 - 20121

Settings

Publication Index: search.filters.publicationIndex.WoSSubject: search.filters.subject.Graph theory

Search Results

Now showing 1 - 4 of 4
  • 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: 2
    Citation - Scopus: 2
    Applying Mathematica and Webmathematica To Graph Coloring
    (Elsevier Ltd., 2007) Ufuktepe, Ünal; Bacak, Gökşen
    This paper analyzes some graph issues by using the symbolic program Mathematica and its version for the Web, webMathematica. In particular, we consider the problem of graph coloring: the assignment of colors to the vertices/edges of the graph such that adjacent vertices/edges are colored differently. In addition, we address the problem of obtaining the tenacity of binomial trees with Mathematica. Finally, we describe briefly an example of the application of our software to a scheduling problem.
  • Conference Object
    Citation - WoS: 1
    Citation - Scopus: 2
    Applications of Graph Coloring
    (Springer Verlag, 2005) Ufuktepe, Ünal; Bacak, Gökşen
    A graph G is a mathematical structure consisting of two sets V(G) (vertices of G) and E(G) (edges of G). Proper coloring of a graph is an assignment of colors either to the vertices of the graphs, or to the edges, in such a way that adjacent vertices / edges are colored differently. This paper discusses coloring and operations on graphs with Mathematica and webMathematica. We consider many classes of graphs to color with applications. We draw any graph and also try to show whether it has an Eulerian and Hamiltonian cycles by using our package ColorG
  • 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.