Filtry
wszystkich: 3286
-
Katalog
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: VERTEX COVER NUMBER
-
Nuts 51 (voj. dolnoslaskie). Number of accidents, injuries, seriously Injured and fatalities
Dane BadawczeThe data contains information about the number of accidents, injuries, seriously Injured and fatalities between 1999 and 2019 in months in voj. dolnoslaskie (Poland, nuts 71).
-
Nuts 81 (voj. lubelskie). Number of accidents, injuries, seriously Injured and fatalities
Dane BadawczeThe data contains information about the number of accidents, injuries, seriously Injured and fatalities between 1999 and 2019 in months in voj. lubelskie (Poland, nuts 81)
-
Nuts 43 (voj. lubuskie). Number of accidents, injuries, seriously Injured and fatalities
Dane BadawczeThe data contains information about the number of accidents, injuries, seriously Injured and fatalities between 1999 and 2019 in months in voj. lubuskie (Poland, nuts 43)
-
Nuts 42 (voj. zachodniopomorskie). Number of accidents, injuries, seriously Injured and fatalities
Dane BadawczeThe data contains information about the number of accidents, injuries, seriously Injured and fatalities between 1999 and 2019 in months in voj. zachodniopomorskie (Poland, nuts 42)
-
Nuts 52 (voj. opolskie). Number of accidents, injuries, seriously Injured and fatalities
Dane BadawczeThe data contains information about the number of accidents, injuries, seriously Injured and fatalities between 1999 and 2019 in months in voj. opolskie (Poland, nuts 52)
-
Nuts 22 (voj. slaskie). Number of accidents, injuries, seriously Injured and fatalities
Dane BadawczeThe data contains information about the number of accidents, injuries, seriously Injured and fatalities between 1999 and 2019 in months in voj. slaskie (Poland, nuts 22)
-
Nuts 71 (voj. lodzkie). Number of accidents, injuries, seriously Injured and fatalities
Dane BadawczeThe data contains information about the number of accidents, injuries, seriously Injured and fatalities between 1999 and 2019 in months in voj. lodzkie (Poland, nuts 71)
-
Nuts 21 (voj. malopolskie). Number of accidents, injuries, seriously Injured and fatalities
Dane BadawczeThe data contains information about the number of accidents, injuries, seriously Injured and fatalities between 1999 and 2019 in months in voj. malopolskie (Poland, nuts 21)
-
Nuts 82 (voj. podkarpackie). Number of accidents, injuries, seriously Injured and fatalities
Dane BadawczeThe data contains information about the number of accidents, injuries, seriously Injured and fatalities between 1999 and 2019 in months in voj. podkarpackie(Poland, nuts 82)
-
Nuts 84 (voj. podlaskie). Number of accidents, injuries, seriously Injured and fatalities
Dane BadawczeThe data contains information about the number of accidents, injuries, seriously Injured and fatalities between 1999 and 2019 in months in voj. podlaskie (Poland, nuts 84)
-
Nuts 63 (voj. pomorskie). Number of accidents, injuries, seriously Injured and fatalities
Dane BadawczeThe data contains information about the number of accidents, injuries, seriously Injured and fatalities between 1999 and 2019 in months in voj. pomorskie (Poland, nuts 63)
-
Nuts 41 (voj. wielkopolskie). Number of accidents, injuries, seriously Injured and fatalities
Dane BadawczeThe data contains information about the number of accidents, injuries, seriously Injured and fatalities between 1999 and 2019 in months in voj. wielkopolskie (Poland, nuts 41)
-
Nuts 72 (voj. swietokrzyskie). Number of accidents, injuries, seriously Injured and fatalities
Dane BadawczeThe data contains information about the number of accidents, injuries, seriously Injured and fatalities between 1999 and 2019 in months in voj. swietokrzyskie (Poland, nuts 72)
-
Number of individual clients who have signed an agreement enabling the use of internet banking (2017)
Dane BadawczeThe data show that at the end of 2017, 32.5 million people in Poland had the opportunity to use internet banking, i.e. signed an agreement enabling the use of internet banking. It is worth noting, however, that the so-called passive users - people who have access, but do not have to log into their account via an internet connection.
-
Anna Lisowska-Oleksiak prof. dr hab.
OsobyAnna Lisowska-Oleksiak, born in 1952, has been working at GUT since 1977. Currently is employed at the Faculty of Chemistry as a full professor. She was employed as a research assistant at the University of St Andrews in the group of C. A. Vincent and P.G. Bruce (1991-1994). She completed a two-month research internship in CEA Grenoble (2011). Anna Lisowska-Oleksiak obtained her MSc in chemistry at Nicolaus Copernicus University...
-
Distributed graph searching with a sense of direction
PublikacjaIn this work we consider the edge searching problem for vertex-weighted graphs with arbitrarily fast and invisible fugitive. The weight function w provides for each vertex v the minimum number of searchers required to guard v, i.e., the fugitive may not pass through v without being detected only if at least w(v) searchers are present at v. This problem is a generalization of the classical edge searching problem, in which one has...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublikacjaLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
Average number of hours worked per week by women aged 15 and older (Poland, Lithuania, Latvia, Estonia)
Dane BadawczeThe following dataset presents the average weekly number of hours worked by women in selected countries (Poland, Lithuania, Latvia, Estonia) in the years 1999 - 2016. The summary includes average weekly time worked in the main job, for women aged 15+. The estimates correspond to the declared amount. This includes part-time and full-time employment,...
-
Amplification of a single-locus variable-number direct-repeats with restriction fragment length polymorphism (DR-PCR/RFLP) for genetic typing of Acinetobacter baumannii strains
PublikacjaW celu poszukiwania nowych metod typowania genetycznego szczepów Acinetobacter baumannii przydatnych w szpitalnych badaniach epidemiologicznych przeprowadzono analizę dostępnych w banku genów sekwencji szczepów referencyjnych na obecność nowych motywów repetytywnych. Do badania polimorfizmu sekwencji repetytywnych w szczepach Acinetobacter sp. wykorzystano proste powtórzenia typu "direct repeat" (DR) zlokalizowane w jednym miejscu...
-
Concurrent DNA Copy-Number Alterations and Mutations in Genes Related to Maintenance of Genome Stability in Uninvolved Mammary Glandular Tissue from Breast Cancer Patients
Publikacja -
The PF6−n(R)n−anions (R = CH3, C2H5;n= 0–6): the dependence of the electronic stability on the number of non-electronegative alkyl ligands
Publikacja -
<p>Potential effects of microbial air quality on the number of new cases of diabetes type 1 in children in two regions of Poland: a pilot study</p>
Publikacja -
Type A Behavior Pattern, Impulsiveness, Risk Propensity, and Empathy as Predictors of Dyspnea and Number of Infections in Men with Chronic Obstructive Pulmonary Disease: A Cross-Sectional Study
Publikacja -
The complete list of two-dimensional rotation-symmetric number-conserving septenary cellular automata
Dane BadawczeThis dataset contains a complete list of all 30144 two-dimensional rotation-symmetric number-con-serving cellular automata with the state set {0,1,2,3,4,5,6} based on adjacent cells only, i.e. with the von Neumann neighborhood. The detailed definitions and the method of enumerating are given in the paper:
-
On incidence coloring of coloring of complete multipartite and semicubic bipartite graphs
PublikacjaIn the paper, we show that the incidence chromatic number of a complete k-partite graph is at most ∆+2 (i.e., proving the incidence coloring conjecture for these graphs) and it is equal to ∆+1 if and only if the smallest part has only one vertex.
-
Common Independence in Graphs
PublikacjaAbstract: The cardinality of a largest independent set of G, denoted by α(G), is called the independence number of G. The independent domination number i(G) of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by αc(G), as the greatest integer r such that every vertex of G belongs to some independent subset X of VG with |X|...
-
Number of tax returns filed by taxpayers obtaining income taxed with a lump sum on income recorded according to sources of income 2011-2015
Dane BadawczeTaxpayers engaged in non-agricultural business activities benefiting from taxation in the form of a lump sum on recorded income, are required to have and store proofs of purchase of goods, keep a list of fixed assets and intangible assets, records of equipment and, separately for each tax year, a record of revenues. The obligation to keep records of...
-
Nuts 61 (voj. kujawsko-pomorskie). Number of accidents, injuries, seriously Injured and fatalities
Dane BadawczeThe data contains information about the number of accidents, injuries, seriously Injured and fatalities between 1999 and 2019 in months in voj. kujawsko-pomorskie (Poland, nuts 61)
-
Nuts 92 (mazowiecki regionalny region). Number of accidents, injuries, seriously Injured and fatalities
Dane BadawczeThe data contains information about the number of accidents, injuries, seriously Injured and fatalities between 1999 and 2019 in months in mazowiecki regionalny region (Poland, nuts 92)
-
Nuts 62 (voj. warminsko-mazurskie). Number of accidents, injuries, seriously Injured and fatalities
Dane BadawczeThe data contains information about the number of accidents, injuries, seriously Injured and fatalities between 1999 and 2019 in months in voj. warminsko-mazurskie (Poland, nuts 62)
-
Nuts 91 (woj. warszawski - stoleczny). Number of accidents, injuries, seriously Injured and fatalities
Dane BadawczeThe data contains information about the number of accidents, injuries, seriously Injured and fatalities between 1999 and 2019 in months in warszawski - stoleczny region (Poland, nuts 91)
-
Number of seasonal work permits issued in 2018
Dane BadawczeIn 2018, a total of 121,436 seasonal work permits were issued, the vast majority of which were granted to Ukrainian citizens. The following dataset shows the countries from which citizens have been issued the most permits.
-
On the partition dimension of trees
PublikacjaGiven an ordered partition Π={P1,P2,…,Pt} of the vertex set V of a connected graph G=(V,E), the partition representation of a vertex v∈V with respect to the partition Π is the vector r(v|Π)=(d(v,P1),d(v,P2),…,d(v,Pt)), where d(v,Pi) represents the distance between the vertex vv and the set Pi. A partition Π of V is a resolving partition of G if different vertices of G have different partition representations, i.e., for every...
-
The Potential of Greed for Independence
PublikacjaThe well-known lower bound on the independence number of a graph due to Caro and Wei can be established as a performance guarantee of two natural and simple greedy algorithms or of a simple randomized algorithm. We study possible generalizations and improvements of these approaches using vertex weights and discuss conditions on so-called potential functions p(G) : V(G) -> N_0 defined on the vertex set of a graph G for which suitably...
-
Graphs with equal domination and certified domination numbers
PublikacjaA 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...
-
Discount for children deducted from tax in selected EU countries, available according to number of children criterion (in EUR) in 2017
Dane BadawczeWhen analyzing the collected data, it should be indicated that the amount of tax preferences addressed to families with children varies widely and ranges from several hundred euro to even several tens of thousands of euro relief annually. The highest family allowances, calculated in absolute terms, are in Germany, and the lowest in Poland. All countries,...
-
On trees with equal domination and total outer-independent domination numbers
PublikacjaFor a graph G=(V,E), a subset D subseteq V(G) is a dominating set if every vertex of V(G)D has a neighbor in D, while it is a total outer-independent dominating set if every vertex of G has a neighbor in D, and the set V(G)D is independent. The domination (total outer-independent domination, respectively) number of G is the minimum cardinality of a dominating (total outer-independent dominating, respectively) set of G. We characterize...
-
Three-fast-searchable graphs
PublikacjaIn the edge searching problem, searchers move from vertex to vertex in a graph to capture an invisible, fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which, at every move, a new edge of the graph G must be guaranteed to be free of the intruder. That is, once all searchers are placed the graph G is cleared in exactly |E(G)| moves. Such a restriction obviously necessitates...
-
Independent Domination Subdivision in Graphs
PublikacjaA set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in~$S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number $i(G)$ of $G$ is the minimum cardinality of an independent dominating set in $G$. The independent domination subdivision number $\sdi(G)$ is the minimum number of edges that must be subdivided (each...
-
Jakub Miler dr inż.
OsobyKariera akademicka: 2000: mgr inż. Wydział ETI, Politechnika Gdańska, praca pt. "Computer system for supporting risk management in a software engineering project", promotor prof. Janusz Górski 2005: dr inż. Wydział ETI, Politechnika Gdańska, rozprawa pt. "A Method of Software Project Risk Identification and Analysis", obroniona z wyróżnieniem, dziedzina nauki techniczne, dyscyplina informatyka, promotor prof. Janusz Górski Zainteresowania...
-
On the ratio between 2-domination and total outer-independent domination numbers of trees
PublikacjaA 2-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. A 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 2-domination (total outer-independent domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (total...
-
Jerzy Kowalski dr hab. inż.
Osoby -
Double bondage in graphs
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G, denoted by gamma_d(G), is the minimum cardinality of a double dominating set of G. The double bondage number of G, denoted by b_d(G), is the minimum cardinality among all sets...
-
Turán numbers for odd wheels
PublikacjaThe 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...
-
Certified domination
PublikacjaImagine that we are given a set D of officials and a set W of civils. For each civil x ∈ W, there must be an official v ∈ D that can serve x, and whenever any such v is serving x, there must also be another civil w ∈ W that observes v, that is, w may act as a kind of witness, to avoid any abuse from v. What is the minimum number of officials to guarantee such a service, assuming a given social network? In this paper, we introduce...
-
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
PublikacjaGiven 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...
-
Emphysema affects the number and appearance of solitary pulmonary nodules identified in chest low-dose computed tomography: a study on high risk lung cancer screenees recruited in Silesian District
Publikacja -
Brushing with additional cleaning restrictions
PublikacjaIn graph cleaning problems, brushes clean a graph by traversing it subject to certain rules. We consider the process where at each time step, a vertex that has at least as many brushes as incident, contaminated edges, sends brushes down these edges to clean them. Various problems arise, such as determining the minimum number of brushes (called the brush number) that are required to clean the entire graph. Here, we study a new variant...
-
Strategic balance in graphs
PublikacjaFor a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...
-
Dynamic F-free Coloring of Graphs
PublikacjaA problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...