Filters
total: 4751
filtered: 3278
-
Catalog
Chosen catalog filters
displaying 1000 best results Help
Search results for: ACHROMATIC NUMBER
-
Block graphs with large paired domination multisubdivision number
PublicationThe paired domination multisubdivision number of a nonempty graph G, denoted by msdpr(G), is the smallest positive integer k such that there exists an edge which must be subdivided k times to increase the paired domination number of G. It is known that msdpr(G) ≤ 4 for all graphs G. We characterize block graphs with msdpr(G) = 4.
-
Computation of the convolution with use of the polynomial residue number system.
PublicationPrzedstawiono użycie wielomianowych systemów resztowych do obliczania splotu w cyfrowych układach dużej skali integracji VLSI.
-
Complex multiplier based on the polynomial residue number system
PublicationPrzedstawiono próbę zaprojektowania mnożnika zespolonego 4x4 opartego na algorytmie Skavantzosa i Stouraitisa. W algorytmie stosuje siękodowanie liczb n-bitowych jako wielomianów stopnia 7 w pierścieniu wielomianów modulo (x^8-1) z n/4-bitowymi współczynnikami. Mnożenie zespolone jest wykonywane jako 8-punktowy splot cykliczny. Podanoopóżnienie i złożoność sprzętową jak również porównanie ze standardowym.rozwiązaniem.
-
Lower bound on the distance k-domination number of a tree
PublicationW artykule przedstawiono dolne ograniczenie na liczbę k-dominowania w drzewach oraz scharakteryzowano wszystkie grafy ekstremalne.
-
Shannon Capacity and Ramsey Numbers
PublicationRamsey-type theorems are strongly related to some results from information theory. In this paper we present these relations.
-
Turán numbers for odd wheels
PublicationThe Turán number ex(n,G) is the maximum number of edges in any n-vertex graph that does not contain a subgraph isomorphic to G. A wheel W_n is a graph on n vertices obtained from a C_{n−1} by adding one vertex w and making w adjacent to all vertices of the C_{n−1}. We obtain two exact values for small wheels: ex(n,W_5)=\lfloor n^2/4+n/2\rfloor, ex(n,W_7)=\lfloor n^2/4+n/2+1 \rfloor. Given that ex(n,W_6) is already known, this...
-
Edge-chromatic sum of trees and bounded cyclicity graphs
Publication -
The circular chromatic index of some class 2 graphs
PublicationW artykule został wyznaczony cyrkularny indeks chromatyczny dla dwóch rodzin grafów klasy 2. Co więcej, podano nie trywialne oszacowania tego parametru dla snarków Isaacsa i Goldberga. Na koniec artykułu rozważana jest złożoność obliczeniowa problemów związanych z cyrkularnym kolorowaniem krawędzi.
-
Relations between the domination parameters and the chromatic index of a graph
PublicationIn this paper we show bounds for the sum and the product of the domination parameters and the chromatic index of a graph. We alsopresent some families of graphs for which these bounds are achieved.
-
Power quality conditioners with minimum number of current sensor requirement
Publication -
The presence of prostate cancer at biopsy is predicted by a number of genetic variants
Publication -
Impact of Cyclist Facility Availability at Work on the Number of Bike Commuters
PublicationThe article describes the results of research designed to establish whether cycle provision can influence the number of employees commuting by bike. To that end, employee surveys were conducted in three IT companies in 2012 and 2016. The questionnaire asked about travel behaviour and what the staff thought about their company’s provision of cyclist facilities. Since 2012 each of the companies has moved its head office and the...
-
Two-dimensional rotation-symmetric number-conserving cellular automata
Publication -
An upper bound on the 2-outer-independent domination number of a tree
PublicationA 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D, and the set V(G)D is independent. The 2-outer-independent domination number of a graph G, denoted by gamma_2^{oi}(G), is the minimum cardinality of a 2-outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_2^{oi}(T) <= (n+l)/2,...
-
Comparison of the Efficiency of Turbo Codes with Mechanisms of Reducing the Number of Iterations
PublicationThe paper presents the construction of encoders and decoders turbo codes with different number of states. Simulation results of the transmission quality of the turbo codes were presented. Decoders for turbo codes have worked with a fixed number of iterations and with the mechanisms reducing the number of iterations. Data were transmitted in Outdoor to Indoor & Pedestrian B environment for data rate 384 kbps. The SOVA algorithm...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublicationA 2-dominating set of a graph G is a set D of vertices of G such that every vertex not in D has a at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. Fink and Jacobson [n-domination in graphs, Graph theory with applications to algorithms and computer science, Wiley, New York, 1985, 283-300] established the following lower bound on the 2-domination...
-
An upper bound on the total outer-independent domination number of a tree
PublicationA 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...
-
A lower bound on the double outer-independent domination number of a tree
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)D is independent. The double outer-independent domination number of a graph G, denoted by gamma_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We...
-
Estimation of Quantities Related to the Multinomial Distribution with Unknown Number of Categories
Publication -
P-653 The impact of clinical factors on the number of MII oocytes
Publication -
A lower bound on the total outer-independent domination number of a tree
PublicationA total outer-independent dominating set of a graph 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 nontrivial tree T of order n with l leaves we have gamma_t^{oi}(T) >= (2n-2l+2)/3,...
-
total number and biomass of bacteria in drinking water distribution systems.
PublicationIn the vast water supply network using traditional methods of treatment it is often impossible to maintain a constant and acceptable microbiological quality of water. In Poland the main reason of bacterial re-growth is presence of organic matter and nutrients in the circulating water and prolonged water retention in the network systems due to the decrease of water consumption, which has been observed for the last 20 years. In the...
-
Nordhaus-Gaddum results for the weakly convex domination number of a graph
PublicationArtykuł dotyczy ograniczenia z góry i z dołu (ze względu na ilość wierzchołków) sumy i iloczynu liczb dominowania wypukłego grafu i jego dopełnienia.
-
Cost minimization in wireless networks with a bounded and unbounded number of interfaces
PublicationPraca dotyczy problemu minimalizacji energii poprzez selektywne odłączanie urządzeń komunikacyjnych w wielointerfejsowych sieciach bezprzewodowych w taki sposób, by zapewnić realizację wymaganego grafu połączeń. Sformułowano problem optymalizacyjny, podano wyniki dotyczące jego trudności i zaproponowano algorytmy optymalizacyjne. Rozważono zarówno wariant, w którym liczba interfejsów komunikacyjnych jest parametrem stałym (narzuconym...
-
Sharp transitions in low-number quantum dots Bayesian magnetometry
PublicationWe consider Bayesian estimate of static magnetic field, characterized by a prior Gaussian probability distribution, in systems of a few electron quantum dot spins interacting with infinite temperature spin environment via hyperfine interaction. Sudden transitions among optimal states and measurements are observed. Usefulness of measuring occupation levels is shown for all times of the evolution, together with the role of entanglement...
-
An upper bound for the double outer-independent domination number of a tree
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)\D is independent. The double outer-independent domination number of a graph G, denoted by γ_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We prove...
-
A 27/26-approximation algorithm for the chromatic sum coloring of bipartitegraphs
PublicationWe consider the CHROMATIC SUM PROBLEM on bipartite graphs which appears to be much harder than the classical CHROMATIC NUMBER PROBLEM. We prove that the CHROMATIC SUM PROBLEM is NP-complete on planar bipartite graphs with Delta less than or equal to 5, but polynomial on bipartite graphs with Delta less than or equal to 3, for which we construct an O(n(2))-time algorithm. Hence, we tighten the borderline of intractability for this...
-
Generating sequences of Lefschetz numbers of iterates
PublicationDu, Huang and Li showed in 2003 that the class of Dold–Fermat sequences coincides with the class of Newton sequences, which are defined in terms of socalled generating sequences. The sequences of Lefschetz numbers of iterates form an important subclass of Dold–Fermat (thus also Newton) sequences. In this paper we characterize generating sequences of Lefschetz numbers of iterates.
-
Weakly connected domination subdivision numbers
PublicationLiczba podziału krawędzi dla dominowania słabo spójnego to najmniejsza liczba krawędzi jaką należy podzielić, aby wzrosła liczba dominowania słabo wypukłego. W pracy przedstawione są własności liczby podziału krawędzi dla dominowania słabo spójnego dla różnych grafów.
-
A NOTE ON ON-LINE RAMSEY NUMBERS FOR QUADRILATERALS
PublicationWe 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...
-
On-line Ramsey Numbers of Paths and Cycles
PublicationConsider a game played on the edge set of the infinite clique by two players, Builder and Painter. In each round, Builder chooses an edge and Painter colours it red or blue. Builder wins by creating either a red copy of $G$ or a blue copy of $H$ for some fixed graphs $G$ and $H$. The minimum number of rounds within which Builder can win, assuming both players play perfectly, is the \emph{on-line Ramsey number} $\tilde{r}(G,H)$. In...
-
Total restrained domination numbers of trees
PublicationOpisane są wszystkie drzewa, w których liczby dominowania totalnego i totalno - powściągniętego są sobie równe, a także podano dolne ograniczenie na liczbę dominowania totalno - powściągniętego w drzewach.
-
Distance paired domination numbers of graphs
PublicationW pracy przedstawione są pewne własności liczb k-dominowania parami w grafach. Wykazane jest, że problem decyzyjny liczby k-dominowania parami jest problemem NP-zupełnym nawet dla grafów dwudzielnych. Przedstawione są ograniczenia górne i dolne dla liczby k-dominowania parami w drzewach i scharakteryzowane drzewa, w których te ograniczenia są osiągnięte.
-
On the connected and weakly convex domination numbers
PublicationIn this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and we focus on the graphs for which a weakly convex domination number equals a connected domination number. We also study the influence of the edge removing on the weakly convex domination number, in particular we show that a weakly convex domination number...
-
Weakly convex and convex domination numbers.
PublicationW artykule przedstawione są nowo zdefiniowane liczby dominowania wypukłego i słabo wypukłego oraz ich porównanie z innymi liczbami dominowania. W szczególności, rozważana jest równość liczby dominowania spójnego i wypukłego dla grafów kubicznych.
-
On the growth of the number of periodic points for smooth self maps of a compact manifold
PublicationDla ciągłego przekształcenia jednospójnej rozmaitości wymiaru co najmniej 3 w siebie, wykazujemy, że wzrost liczby punktów r-periodycznych w klasie homotopii może być nie szybszy niż liniowy, dla dowolnego, ustalonego r.
-
Quasi-resonant dc-link inverter with a reduced number of active elements
PublicationW artykule przedstawiono nową topologię równoległego quasi-rezonansowego obwodu pośredniczącego falownika napięcia. Opisano sekwencje miękkiej komutacji falownika w dwukierunkowym trybie pracy falowniczej i prostowniczej. Analiza układu została zweryfikowana badaniami symulacyjnymi i eksperymentalnymi. Przedstawiona topologia odznacza się prostą strukturą oraz małą ilością elementów aktywnych. Dzięki zastosowaniu krzepkiej strategii...
-
Emphysema affects the number and characteristics of solitary pulmonary nodules. Authors' reply
Publication -
All graphs with paired-domination number two less than their order
PublicationLet 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...
-
Mersenne Number Finding and Collatz Hypothesis Verification in the Comcute Grid System
PublicationIn this chapter, some mathematic applications have been described to test scalability of the Comcute grid system. Especially, a verification of the Collatz hypothesis and finding Mersenne numbers were applied to prove the scalability and high performance of this grid system. Results were compared with outcomes obtained by the other grid systems.
-
Minimal number of periodic points for smooth self-maps of S^3
PublicationW pracy wyznaczona została najmniejsza liczba punktów periodycznych w gładkiej klasie homotopii odwzorowania sfery trójwymiarowej w siebie.
-
Reducing the Number of Microlocations in Oligonucleotide Microchip Matrices by the Application of Degenerate Oligonucleotides
Publication -
Maximum A Posteriori Bayesian Estimation of Chromatographic Parameters by Limited Number of Experiments
Publication -
Minimal number of periodic points for smooth self-maps of RP^3
PublicationNiech f będzie gładkim odwzorowaniem 3-wymiarowej rzeczywistej przestrzeni rzutowej w siebie, r będzie ustaloną liczbą naturalną. W artykule wyznaczona została minimalna liczba punktów r-periodycznych w gładkiej klasie homotopii odwzorowania f.
-
All graphs with restrained domination number three less than their order
PublicationW pracy opisana jest rodzina wszystkich grafów, dla których liczbadominowania zewnętrznego jest o trzy mniejsza od ich rzędu.
-
Realistic noise-tolerant randomness amplification using finite number of devices
PublicationRandomness is a fundamental concept, with implications from security of modern data systems, to fundamental laws of nature and even the philosophy of science. Randomness is called certified if it describes events that cannot be pre-determined by an external adversary. It is known that weak certified randomness can be amplified to nearly ideal randomness using quantum-mechanical systems. However, so far, it was unclear whether randomness amplification...
-
Mechanical exfoliation and layer number identification of single crystal monoclinic CrCl3
PublicationAfter the recent finding that CrI3, displays ferromagnetic order down to its monolayer, extensive studies have followed to pursue new two-dimensional (2D) magnetic materials. In this article, we report on the growth of single crystal CrCl3 in the layered monoclinic phase. The system after mechanical exfoliation exhibits stability in ambient air (the degradation occurs on a time scale at least four orders of magnitude longer than...
-
Accuracy Of The GPS Positioning System In The Context Of Increasing The Number Of Satellites In The Constellation
Publication -
Buckling and shape control of prestressable trusses using optimum number of actuators
PublicationThis paper describes a method to control the nodal displacement of prestressable truss structures within the desired domains. At the same time, the stress in all members is unleashed to take any value between the allowable tensile stress and critical buckling stress. The shape and stresses are controlled by actuating the most active members. The technique considers the members’ initial crookedness, residual stresses, and slenderness...
-
A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves
PublicationW pracy rozważa się rozproszony model obliczeń, w którym struktura systemu jest reprezentowana przez graf bezpośrednich połączeń komunikacyjnych. W tym modelu podajemy nowy samostabilizujący algorytm znajdowania drzewa spinającego. Zgodnie z naszą wiedzą jest to pierwszy algorytm dla tego problemu z gwarantowaną wielomianową liczbą ruchów.