Wyniki wyszukiwania dla: INDISTINGUISHABLE SETS

• Neutrosophic Sets and Systems

  Czasopisma

  ISSN: 2331-6055

• NOTES on INTUITIONISTIC FUZZY SETS

  Czasopisma

  ISSN: 1310-4926

• Super Dominating Sets in Graphs

  Publikacja

  • M. Lemańska
  • V. Swaminathan
  • Y. Venkatakrishnan
  • R. Zuazua

  - PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES INDIA SECTION A-PHYSICAL SCIENCES - Rok 2015

  In this paper some results on the super domination number are obtained. We prove that if T is a tree with at least three vertices, then n2≤γsp(T)≤n−s, where s is the number of support vertices in T and we characterize the extremal trees.

  Pełny tekst do pobrania w serwisie zewnętrznym

• Global defensive sets in graphs

  Publikacja

  • R. Lewoń
  • A. Małafiejska
  • M. Małafiejski

  - DISCRETE MATHEMATICS - Rok 2016

  In the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...

  Pełny tekst do pobrania w portalu

• Minimal double dominating sets in trees

  Publikacja

  • M. Krzywkowski

  - Rok 2014

  We provide an algorithm for listing all minimal double dominating sets of a tree of order $n$ in time $\mathcal{O}(1.3248^n)$. This implies that every tree has at most $1.3248^n$ minimal double dominating sets. We also show that this bound is tight.

• Developing sets of experience knowledge structure

  Publikacja

  • E. Szczerbicki
  • C. Sanin

  - Rok 2008

  W pracy omówiono zasady tworzenia opisu zwanego zbiorem doświadczeń tworzonego w celu reprezentacji wiedzy

• Minimal 2-dominating sets in Trees

  Publikacja

  • M. Krzywkowski

  - RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS - Rok 2013

  We provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3247^n). This leads to that every tree has at most 1.3247^n minimal 2-dominating sets. We also show that thisbound is tight.

  Pełny tekst do pobrania w serwisie zewnętrznym

• On proper (1,2)‐dominating sets in graphs

  Publikacja

  • A. Michalski
  • I. Włoch
  • M. Dettlaff
  • M. Lemańska

  - MATHEMATICAL METHODS IN THE APPLIED SCIENCES - Rok 2022

  In 2008, Hedetniemi et al. introduced the concept of (1,)-domination and obtained some interesting results for (1,2) -domination. Obviously every (1,1) -dominating set of a graph (known as 2-dominating set) is (1,2) -dominating; to distinguish these concepts, we define a proper (1,2) -dominating set of a graph as follows: a subset is a proper (1,2) -dominating set of a graph if is (1,2) -dominating and it is not a (1,1) -dominating...

  Pełny tekst do pobrania w serwisie zewnętrznym

• Reconfiguring Minimum Dominating Sets in Trees

  Publikacja

  • M. Lemańska
  • P. Żyliński

  - Journal of Graph Algorithms and Applications - Rok 2020

  We provide tight bounds on the diameter of γ-graphs, which are reconfiguration graphs of the minimum dominating sets of a graph G. In particular, we prove that for any tree T of order n ≥ 3, the diameter of its γ-graph is at most n/2 in the single vertex replacement adjacency model, whereas in the slide adjacency model, it is at most 2(n − 1)/3. Our proof is constructive, leading to a simple linear-time algorithm for determining...

  Pełny tekst do pobrania w portalu

• Acoustic verification on onomatopoeic sets in contrastive approach

  Publikacja

  • K. Wojan

  - Archives of Acoustics - Rok 2008