Search results

article

On the hypersurfaces contained in their Hessian

Pietro De Poi, Giovanna Ilardi

Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica > 2019 > 18

article

Local convergence comparison between two novel sixth order methods for solving equations

Santhosh George, Ioannis K. Argyros

Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica > 2019 > 18

article

Russian Translations and Translators of Western European works (XVIII - early twentieth century) devoted to the history of mathematics

Natalia Vasilievna Lokot

Antiquitates Mathematicae > 2019

This work is a continuation of the author's presentation of the history of mathematics in Russia as a research area within the history of science (v. Lokot (2018)). The elements of the history of mathematics began to intensively emerge in the epoch of Peter the Great and have undergone several stages of development. There are five stages that Russian scientists have gone through, shaping the elements...

article

The phenomenon of the Steinhaus Seminar on Applied Mathematics: Topics

Władysław Szczotka

Antiquitates Mathematicae > 2019

This article presents the subject of the Applied Mathematics Seminar, conducted in 1948-1960 by Professor Hugon Steinhaus in Wrocław and is an important supplement to the analysis presented in the work of Szczotka (2018). This topic is illustrated by a more detailed discussion of some of the works on this subject and some of the results obtained by the participants of the Seminar. The results are...

article

XLVII National Conference on Applications of Mathematics, September 4-11, 2018, Zakopane-Kościelisko, Poland

Łukasz Stettner

Mathematica Applicanda > 2019 > 47

The 47th National Conference on Mathematics Applications was held on September 4-11, 2018 in Zakopane Kościelisko. Together with the conference, the XXIV National Conference on Mathematics Applications in Biology and Medicine (4-7 September 2018) was held simultaneously with two common first days of the meeting. The plenary lecture was delivered by Urszula Ledzewicz (Southern Illinois University Edwardsville,...

article

XLIV Conference "Mathematical Statistics", Będlewo 2018

Przemysław Grzegorzewski

Mathematica Applicanda > 2019 > 47

On December 2--7, 2018, in Będlewo, the XLIV Conference "Mathematical Statistics" was held, organized by the Banach Center of Institute of Mathematics Polish Accademy of Science, the Committee on Statistics of the Committee of Mathematics of the Polish Academy of Sciences, and the Faculty of Mathematics and Computer Science of the Nicolaus Copernicus University in Toruń. During the 19 sessions,...

article

De Vylder type approximation of the ruin probability for the insurer-reinsurer model

Krzysztof Burnecki, Marek A. Teuerle, Aleksandra Wilkowska

Mathematica Applicanda > 2019 > 47

In this article we introduce a De Vylder type of approximation of the ruin probability for a two-dimensional risk process, where claims and premiums are shared with a predetermined proportion. Such a process is usually associated with the insurer - reinsurer model. Applying De Vylder’s idea to the risk process we obtain an approximation of the ruin probability for an arbitrary claim amount distribution...

article

Mathematical Days at WUST

Zuzanna Materny

Mathematica Applicanda > 2019 > 47

Polish Nationwide Mathematical Student Conference OMatKo!!! was set up by students from all four mathematical scientific clubs at Wroclaw University of Science and Technology. The fifth edition of our conference took place from 13th to 15th of April 2018 and it has become the biggest mathematical student conference in the whole country, attracting more than 200 students. There are both Polish and...

article

Nauki społeczne-matematyczne czy matematyzowalne? 27 -- 28 września 2018, Kraków

Agnieszka Lipieta

Mathematica Applicanda > 2019 > 47

W dniach 27 i 28 września 2018 roku na Uniwersytecie Ekonomicznym w Krakowie odbyła się konferencja {\it Nauki społeczne - matematyczne czy matematyzowalne?} poświęcona pamięci prof. dr. hab. Andrzeja Malawskiego, matematyka, filozofa i ekonomisty, wielkiego entuzjasty zastosowań matematyki w naukach społecznych, a zwłaszcza w teorii ekonomii. Andrzej Malawski ukończył dwa kierunki studiów na Uniwersytecie...

article

Polish Nationwide Mathematical Student Conference OMatKo!!!

Antonina Urbaniak

Mathematica Applicanda > 2019 > 47

Polish Nationwide Mathematical Student Conference OMatKo!!! was set up by students from all four mathematical scientific clubs at Wroclaw University of Science and Technology. The fifth edition of our conference took place from 13th to 15th of April 2018 and it has become the biggest mathematical student conference in the whole country, attracting more than 200 students. There are both polish and...

article

Domination Parameters of a Graph and its Complement

Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 203-215

A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G. Placing constraints on a dominating set yields different domination parameters, including total, connected, restrained, and clique domination numbers. In this paper, we study relationships...

article

Inverse Problem on the Steiner Wiener Index

Xueliang Li, Yaping Mao, Ivan Gutman

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 83-95

The Wiener index W(G) of a connected graph G, introduced by Wiener in 1947, is defined as W(G) =∑u,v∈V (G) dG(u, v), where dG(u, v) is the distance (the length a shortest path) between the vertices u and v in G. For S ⊆ V (G), the Steiner distance d(S) of the vertices of S, introduced by Chartrand et al. in 1989, is the minimum size of a connected subgraph of G whose vertex set contains S. The k-th...

article

The Distance Magic Index of a Graph

Aloysius Godinho, Tarkeshwar Singh, S. Arumugam

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 135-142

Let G be a graph of order n and let S be a set of positive integers with |S| = n. Then G is said to be S-magic if there exists a bijection ϕ : V (G) → S satisfying ∑x∈N(u) ϕ(x) = k (a constant) for every u ∈ V (G). Let α(S) = max{s : s ∈ S}. Let i(G) = min α(S), where the minimum is taken over all sets S for which the graph G admits an S-magic labeling. Then i(G) − n is called the distance magic index...

article

Upper Bounds for the Strong Chromatic Index of Halin Graphs

Ziyu Hu, Ko-Wei Lih, Daphne Der-Fen Liu

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 5-26

The strong chromatic index of a graph G, denoted by χ′s(G), is the minimum number of vertex induced matchings needed to partition the edge set of G. Let T be a tree without vertices of degree 2 and have at least one vertex of degree greater than 2. We construct a Halin graph G by drawing T on the plane and then drawing a cycle C connecting all its leaves in such a way that C forms the boundary of...

article

Cubic Graphs with Total Domatic Number at Least Two

Saieed Akbari, Mohammad Motiei, Sahand Mozaffari, Sina Yazdanbod

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 75-82

Let G be a graph with no isolated vertex. A total dominating set of G is a set S of vertices of G such that every vertex is adjacent to at least one vertex in S. The total domatic number of a graph is the maximum number of total dominating sets which partition the vertex set of G. In this paper we provide a criterion under which a cubic graph has total domatic number at least two.

article

Core Index of Perfect Matching Polytope for a 2-Connected Cubic Graph

Xiumei Wang, Yixun Lin

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 189-201

For a 2-connected cubic graph G, the perfect matching polytope P(G) of G contains a special point [...] xc=(13,13,…,13) $x^c = \left( {{1 \over 3},{1 \over 3}, \ldots ,{1 \over 3}} \right)$ . The core index ϕ(P(G)) of the polytope P(G) is the minimum number of vertices of P(G) whose convex hull contains xc. The Fulkerson’s conjecture asserts that every 2-connected cubic graph G has six perfect matchings...

article

Fibonacci and Telephone Numbers in Extremal Trees

Urszula Bednarz, Iwona Włoch

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 121-133

In this paper we shall show applications of the Fibonacci numbers in edge-coloured trees. In particular we determine the successive extremal graphs in the class of trees with respect to the number of (A, 2B)-edge colourings. We show connections between these numbers and Fibonacci numbers as well as the telephone numbers.

article

Hereditary Equality of Domination and Exponential Domination

Michael A. Henning, Simon Jäger, Dieter Rautenbach

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 275-285

We characterize a large subclass of the class of those graphs G for which the exponential domination number of H equals the domination number of H for every induced subgraph H of G.

article

Rainbow Vertex-Connection and Forbidden Subgraphs

Wenjing Li, Xueliang Li, Jingshu Zhang

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 143-154

A path in a vertex-colored graph is called vertex-rainbow if its internal vertices have pairwise distinct colors. A vertex-colored graph G is rainbow vertex-connected if for any two distinct vertices of G, there is a vertex-rainbow path connecting them. For a connected graph G, the rainbow vertex-connection number of G, denoted by rvc(G), is defined as the minimum number of colors that are required...

article

Cores, Joins and the Fano-Flow Conjectures

Ligang Jin, Eckhard Steffen, Giuseppe Mazzuoccolo

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 165-175

The Fan-Raspaud Conjecture states that every bridgeless cubic graph has three 1-factors with empty intersection. A weaker one than this conjecture is that every bridgeless cubic graph has two 1-factors and one join with empty intersection. Both of these two conjectures can be related to conjectures on Fano-flows. In this paper, we show that these two conjectures are equivalent to some statements on...

INFONA - science communication portal

Search results

On the hypersurfaces contained in their Hessian

Local convergence comparison between two novel sixth order methods for solving equations

Russian Translations and Translators of Western European works (XVIII - early twentieth century) devoted to the history of mathematics

The phenomenon of the Steinhaus Seminar on Applied Mathematics: Topics

XLVII National Conference on Applications of Mathematics, September 4-11, 2018, Zakopane-Kościelisko, Poland

XLIV Conference "Mathematical Statistics", Będlewo 2018

De Vylder type approximation of the ruin probability for the insurer-reinsurer model

Mathematical Days at WUST

Nauki społeczne-matematyczne czy matematyzowalne? 27 -- 28 września 2018, Kraków

Polish Nationwide Mathematical Student Conference OMatKo!!!

Domination Parameters of a Graph and its Complement

Inverse Problem on the Steiner Wiener Index

The Distance Magic Index of a Graph

Upper Bounds for the Strong Chromatic Index of Halin Graphs

Cubic Graphs with Total Domatic Number at Least Two

Core Index of Perfect Matching Polytope for a 2-Connected Cubic Graph

Fibonacci and Telephone Numbers in Extremal Trees

Hereditary Equality of Domination and Exponential Domination

Rainbow Vertex-Connection and Forbidden Subgraphs

Cores, Joins and the Fano-Flow Conjectures

Filter options

Publication date

Content availability

Publication type

Publication language

Keywords

INFONA - science communication portal

Search results

Add recipient

Sending message cancelled

Are you sure you want to cancel sending this message?

Send message

Filter options

Publication date

Date range setting

Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.

Content availability

Publication type

Publication language

Keywords

Reporting an error / abuse

Sending the report failed

Accessibility options