Rok 2019

• Graphs with equal domination and certified domination numbers

  Publikacja

  • M. Dettlaff
  • M. Lemańska
  • J. Topp
  • M. Miotk
  • R. Ziemann
  • P. Żyliński

  - Opuscula Mathematica - Rok 2019

  A setDof vertices of a graphG= (VG,EG) is a dominating set ofGif every vertexinVG−Dis adjacent to at least one vertex inD. The domination number (upper dominationnumber, respectively) ofG, denoted byγ(G) (Γ(G), respectively), is the cardinality ofa smallest (largest minimal, respectively) dominating set ofG. A subsetD⊆VGis calleda certified dominating set ofGifDis a dominating set ofGand every vertex inDhas eitherzero...

  Pełny tekst do pobrania w portalu

Rok 2018

• On domination multisubdivision number of unicyclic graphs

  Publikacja

  • J. Raczek

  - Opuscula Mathematica - Rok 2018

  The paper continues the interesting study of the domination subdivision number and the domination multisubdivision number. On the basis of the constructive characterization of the trees with the domination subdivision number equal to 3 given in [H. Aram, S.M. Sheikholeslami, O. Favaron, Domination subdivision number of trees, Discrete Math. 309 (2009), 622–628], we constructively characterize all connected unicyclic graphs with...

  Pełny tekst do pobrania w portalu

Rok 2016

• Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs

  Publikacja

  • M. Dettlaff
  • J. Raczek
  • I. G. Yero

  - Opuscula Mathematica - Rok 2016

  Given a graph G= (V, E), the subdivision of an edge e=uv∈E(G) means the substitution of the edge e by a vertex x and the new edges ux and xv. The domination subdivision number of a graph G is the minimum number of edges of G which must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. Also, the domination multisubdivision number of G is the minimum number of subdivisions...

  Pełny tekst do pobrania w portalu

Rok 2015

• The paired-domination and the upper paired-domination numbers of graphs

  Publikacja

  • W. Ulatowski

  - Opuscula Mathematica - Rok 2015

  In this paper we obtain the upper bound for the upper paired-domination number and we determine the extremal graphs achieving this bound. Moreover we determine the upper paired- domination number for cycles.

  Pełny tekst do pobrania w portalu

Rok 2014

• A NOTE ON ON-LINE RAMSEY NUMBERS FOR QUADRILATERALS

  Publikacja

  • J. Cyman
  • T. Dzido

  - Opuscula Mathematica - Rok 2014

  We consider on-line Ramsey numbers defined by a game played between two players, Builder and Painter. In each round Builder draws an the edge and Painter colors it either red or blue, as it appears. Builder’s goal is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum number of rounds (assuming both players play perfectly) is the on-line Ramsey number \widetilde{r}(H) of...

  Pełny tekst do pobrania w portalu

• Difference functional inequalities and applications.

  Publikacja

  • A. Szafrańska

  - Opuscula Mathematica - Rok 2014

  The paper deals with the difference inequalities generated by initial boundary value problems for hyperbolic nonlinear differential functional systems. We apply this result to investigate the stability of constructed difference schemes. The proof of the convergence of the difference method is based on the comparison technique, and the result for difference functional inequalities is used. Numerical examples are presented.

  Pełny tekst do pobrania w portalu

Rok 2013

• All graphs with paired-domination number two less than their order

  Publikacja

  • W. Ulatowski

  - Opuscula Mathematica - Rok 2013

  Let G=(V,E) be a graph with no isolated vertices. A set S⊆V is a paired-dominating set of G if every vertex not in S is adjacent with some vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination number γp(G) of G is defined to be the minimum cardinality of a paired-dominating set of G. Let G be a graph of order n. In [Paired-domination in graphs, Networks 32 (1998), 199-206] Haynes and Slater...

  Pełny tekst do pobrania w portalu

Rok 2012

• An upper bound on the total outer-independent domination number of a tree

  Publikacja

  • M. Krzywkowski

  - Opuscula Mathematica - Rok 2012

  A total outer-independent dominating set of a graph G=(V(G),E(G)) is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...

  Pełny tekst do pobrania w portalu

• On the hat problem on a graph

  Publikacja

  • M. Krzywkowski

  - Opuscula Mathematica - Rok 2012

  The topic of this paper is the hat problem in which each of n players is uniformly and independently fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning....

  Pełny tekst do pobrania w portalu

Rok 2008

• The work of Professor Andrzej Lasota on asymptotic stability and recent progress

  Publikacja

  • W. Bartoszek

  - Opuscula Mathematica - Rok 2008

  Praca poświęcona jest wkładowi Profesora Andrzeja Lasoty w teorię asymptotycznej stabilności iteracji operatorów stochastycznych na przestrzeni ostatnich 36 lat. Podkreślono aplikacyjny charakter wyników, pokazując stosowne przykłady z modelowania rozwoju komórki, optymalizacji wierceń geologicznych i ewolucji modeli kwantowych.

  Pełny tekst do pobrania w portalu

• Weakly connected domination critical graphs

  Publikacja

  • M. Lemańska
  • A. Patyk-Łońska

  - Opuscula Mathematica - Rok 2008

  Praca dotyczy niektórych klas grafów krytycznych ze względu na liczbę dominowania słabo spójnego.

  Pełny tekst do pobrania w portalu

Rok 2004

• NP-completeness of convex and weakly convex domiating set decision problems.

  Publikacja

  • J. Raczek

  - Opuscula Mathematica - Rok 2004

  Liczby dominowania wypukłego i słabo wypukłego są nowymi rodzajami liczb dominowania. W tym artykule pokazujemy, że problemy decyzyjne dominowania wypukłegi i słabo wypukłego są NP-zupełne w przypadku grafów dwudzielnych oraz split grafów. Posługując się zmodyfikowanym algorytmem Washalla możemy w czasie wielomianowym określić, czy dany podzbiór wierzchołków grafu jest spójny bądź słabo spójny.

  Pełny tekst do pobrania w portalu