Search
Search results for: (TOTAL) DOMINATION SUBDIVISION NUMBER
-
Microbiological Survey in Two Arctic Fjords: Total Bacterial Number and Biomass Comparison of Hornsund and Kongsfjorden
PublicationTwo microbiological parameters: total bacterial number (TBN) and biomass (BBM) were studied in two Arctic fjords: Hornsund and Kongsfjorden. Samples were collected from three sampling points in each fjord, from various water depth layers: from the surface to 75 m depth. Total bacterial number and biomass were examined using the DAPI staining and direct count method. The greater amount of bacteria, as well as highest bacterial biomass...
-
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.
-
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.
-
The share of BEV and PHEV in total number of registered vehicles (%) 2011-2016
Open Research DataIn 2016, the highest percentage of electric vehicles among all passenger automobiles was recorded in Norway - about 28% (it should be noted that in 5 years the number of electric cars in this country increased from 5 thousand to 133 thousand). However, the remaining countries in the ranking note a much smaller share of sales of electric vehicles in...
-
Determination of the total number of microorganisms in a model food product preserved by CS-2a and CS-2b.
Open Research DataThe dataset contains the results of determination of the total number of microorganisms in a model food product after the use of the innovative preservatives: CS-2a and CS-2b and control (K) after seven days of refrigerated storage of the product. The test was performed using the surface inoculation method.
-
INFLUENCE OF A VERTEX REMOVING ON THE CONNECTED DOMINATION NUMBER – APPLICATION TO AD-HOC WIRELESS NETWORKS
PublicationA minimum connected dominating set (MCDS) can be used as virtual backbone in ad-hoc wireless networks for efficient routing and broadcasting tasks. To find the MCDS is an NP- complete problem even in unit disk graphs. Many suboptimal algorithms are reported in the literature to find the MCDS using local information instead to use global network knowledge, achieving an important reduction in complexity. Since a wireless network...
-
Microbiological Survey in Two Arctic Fjords: Total Bacterial Number and Biomass Comparison of Hornsund and Kongsfjorden
Publication -
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...
-
The paired-domination and the upper paired-domination numbers of graphs
PublicationIn 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.
-
Certified domination
PublicationImagine 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...
-
2-outer-independent domination in graphs
PublicationWe initiate the study of 2-outer-independent domination in graphs. A 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 at least two neighbors in D, and the set V(G)\D is independent. The 2-outer-independent domination number of a graph G is the minimum cardinality of a 2-outer-independent dominating set of G. We show that if a graph has minimum degree at least two,...
-
Bondage number of grid graphs
PublicationThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than the domination number of G. Here we study the bondage number of some grid-like graphs. In this sense, we obtain some bounds or exact values of the bondage number of some strong product and direct product of two paths.
-
Graphs with equal domination and certified domination numbers
PublicationA 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...
-
On trees with equal 2-domination and 2-outer-independent domination numbers
PublicationFor a graph G = (V,E), a subset D \subseteq V(G) is a 2-dominating set if every vertex of V(G)\D$ has at least two neighbors in D, while it is a 2-outer-independent dominating set if additionally the set V(G)\D is independent. The 2-domination (2-outer-independent domination, respectively) number of G, is the minimum cardinality of a 2-dominating (2-outer-independent dominating, respectively) set of G. We characterize all trees...
-
Weakly convex and convex domination numbers of some products of graphs
PublicationIf $G=(V,E)$ is a simple connected graph and $a,b\in V$, then a shortest $(a-b)$ path is called a $(u-v)$-{\it geodesic}. A set $X\subseteq V$ is called {\it weakly convex} in $G$ if for every two vertices $a,b\in X$ exists $(a-b)$- geodesic whose all vertices belong to $X$. A set $X$ is {\it convex} in $G$ if for every $a,b\in X$ all vertices from every $(a-b)$-geodesic belong to $X$. The {\it weakly convex domination number}...
-
Super Dominating Sets in Graphs
PublicationIn 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.
-
Secure Italian domination in graphs
PublicationAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
-
Cops, a fast robber and defensive domination on interval graphs
PublicationThe game of Cops and ∞-fast Robber is played by two players, one controlling c cops, the other one robber. The players alternate in turns: all the cops move at once to distance at most one each, the robber moves along any cop-free path. Cops win by sharing a vertex with the robber, the robber by avoiding capture indefinitely. The game was proposed with bounded robber speed by Fomin et al. in “Pursuing a fast robber on a graph”,...
-
Janusz Nieznański prof. dr hab. inż.
PeopleJanusz Nieznański born in 1957 in Gdańsk. He received the M.Sc. degree in 1981, the Ph.D. degree in 1990, and the D.Sc. (‘habilitation’) degree in 1999, all from the Gdańsk University of Technology. Since 1981 he has been with the above university, where he is currently Professor of Electrical Engineering. His research and teaching interests include control, diagnostics, modeling and simulation of power electronic converters and...
-
Some Progress on Total Bondage in Graphs
PublicationThe total bondage number b_t(G) of a graph G with no isolated vertex is the cardinality of a smallest set of edges E'⊆E(G) for which (1) G−E' has no isolated vertex, and (2) γ_t(G−E')>γ_t(G). We improve some results on the total bondage number of a graph and give a constructive characterization of a certain class of trees achieving the upper bound on the total bondage number.
-
Some variations of perfect graphs
PublicationWe consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) =γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k -path vertex cover number and the distance (k−1)-domination number, respectively. We study (ψk−γk−1)-perfect paths, cycles and complete graphs for k≥2. Moreover, we provide a complete characterisation of (ψ2−γ1)-perfect graphs describing the set of its forbidden induced subgraphs and providing...
-
The assessment of microbiological purity of cosmetic preparations
Open Research DataThe dataset contains the results of a single series of determinations of the microbiological purity of the cosmetic based on the aqueous phase in the test for the total number of bacteria and the total number of yeasts.The tests were performed by preparing a series of decimal dilutions of the cosmetic in peptone water and performing in-depth culture...
-
Total chromatic sum for trees
PublicationThe total chromatic sum of a graph is the minimum sum of colors (natural numbers) taken over all proper colorings of vertices and edges of a graph. We provide infinite families of trees for which the minimum number of colors to achieve the total chromatic sum is equal to the total chromatic number. We construct infinite families of trees for which these numbers are not equal, disproving the conjecture from 2012.
-
Paweł Burdziakowski dr inż.
PeoplePaweł Burdziakowski, PhD, is a professional in low-altitude aerial photogrammetry and remote sensing, marine and aerial navigation. He is also a licensed flight instructor and software developer. His main areas of interest are digital photogrammetry, navigation of unmanned platforms and unmanned systems, including aerial, surface, underwater. He conducts research in algorithms and methods to improve the quality of spatial measurements...
-
Modelling of acoustic backscattering by southern Baltic herring
PublicationAssessment of Baltic herring abundance can be carried out using acoustic techniques. Analysis of the relationship between the Baltic herring individual target strength, TS, and the total fish length, L, important for the acoustic assessment, showed the relationship to be dependent on the location of the study area. This finding motivated a detailed analysis of the relationship for the herring occurring in the southern Baltic...
-
Methodology of the Morphometry Study on Baltic Herring
PublicationAcoustic techniques are used in the estimation of the abundance of Baltic herring. Investigations of the relationship between the Baltic herring individual target strength TS and the total fish length L, significant in the acoustic assessment, demonstrated its de-pendence on the study area location. It motivated the detailed analysis of the relationship between herring from the southern Baltic ICES Subdivisions 24, 25, and 26,...
-
Bipartite theory of graphs: outer-independent domination
PublicationLet $G = (V,E)$ be a bipartite graph with partite sets $X$ and $Y$. Two vertices of $X$ are $X$-adjacent if they have a common neighbor in $Y$, and they are $X$-independent otherwise. A subset $D \subseteq X$ is an $X$-outer-independent dominating set of $G$ if every vertex of $X \setminus D$ has an $X$-neighbor in $D$, and all vertices of $X \setminus D$ are pairwise $X$-independent. The $X$-outer-independent domination number...
-
2-bondage in graphs
PublicationA 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has 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. The 2-bondage number of G, denoted by b_2(G), is the minimum cardinality among all sets of edges E' subseteq E such that gamma_2(G-E') > gamma_2(G). If for every E' subseteq E we have...
-
Common Independence in Graphs
PublicationAbstract: 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 bank branches per million inhabitants in EU countries 2015
Open Research DataAccording to the data presented, over the year (2016-2017), the network of bank branches in Poland decreased by over half a thousand (currently the total number of traditional bank branches, excluding partner branches, amounts to nearly 6 thousand). It is worth noting, however, that the number of bank branches per million inhabitants is the highest...
-
Number of own bank branches (2017)
Open Research DataThe number of traditional bank branches is decreasing. As can be seen from the data presented in the table below, over the year (2016-2017), the network of bank branches in Poland decreased by over half a thousand (currently the total number of traditional bank branches, excluding partner branches, amounts to nearly 6 thousand). None of the 20 largest...
-
Double bondage in graphs
PublicationA 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...
-
An evaluation and explanation of (in)efficiency in higher education institutions in Europe and the U.S. with the application of two-stage semi-parametric DEA
PublicationThis study uses data envelopment analysis (DEA) to evaluate the relative efficiency of 500 higher education institutions (HEIs) in ten European countries and the U.S. for the period between 2000 and 2010. Efficiency scores are determined using different input-output sets (inputs: total revenue, academic staff, administration staff, total number of students; outputs: total number of publications, number of scientific articles, graduates)...
-
The structure of the Polish banking sector in 2004-2018
Open Research DataDynamic changes in the banking system in the 1990s contributed to the relative stability of the number of banks in all sectors (state-owned, private, cooperative) after 2004. The total number of banks (including credit institutions) has decreased since 2004 from 653 to 612 in 2018 - it should therefore be noted that in the analyzed period the Polish...
-
The number of enterprises in Poland and selected EU countries in 2012
Open Research DataIn 2012, Poland was sixth in the ranking of the number of enterprises in selected European Union countries. In total, 22 million companies conduct business in the countries of the Community. However, when analyzing these values in relative numbers (calculated as the number of enterprises per 1000 inhabitants), Poland ranks only 22nd among the Member...
-
Non-isolating 2-bondage in graphs
PublicationA 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has 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. The non-isolating 2-bondage number of G, denoted by b_2'(G), is the minimum cardinality among all sets of edges E' subseteq E such that delta(G-E') >= 1 and gamma_2(G-E') > gamma_2(G)....
-
Non-isolating bondage in graphs
PublicationA dominating set of a graph $G = (V,E)$ is a set $D$ of vertices of $G$ such that every vertex of $V(G) \setminus D$ has a neighbor in $D$. The domination number of a graph $G$, denoted by $\gamma(G)$, is the minimum cardinality of a dominating set of $G$. The non-isolating bondage number of $G$, denoted by $b'(G)$, is the minimum cardinality among all sets of edges $E' \subseteq E$ such that $\delta(G-E') \ge 1$ and $\gamma(G-E')...
-
Number of students per one lecturer in the academic year 2010/2011 at Polish univeristies
Open Research DataAs at the end of December 2010, 103.5 thousand academic teachers worked in universities (full-time and part-time equivalent to full-time employment), including 1.9 thous. foreigners. Teachers working in public schools accounted for almost 82.7% of the total number of employees in higher education, and lecturers from non-public universities - 17.3%....
-
Areas of updraft air motion from WRF model simulations.
Open Research DataPresented dataset is a part of numerical modelling study focusing on the analysis of sea ice floes size distribution (FSD) influence on the horizontal and vertical structure of convection in the atmosphere. The total area and spatial arrangement of the updrafts indicates that the FSD affects the total moisture content and the values of area averaged...
-
A note on total reinforcement in graphs
PublicationIn this note we prove a conjecture and inprove some results presendet in a recent paper of N. Sridharan, M.D. Elias, V.S.A. Subramanian, Total reinforcement number of a graph, AKCE Int. J. Graphs Comb. 4 (2) (2007) 197-202.
-
Number of foreigners registered for pension and disability insurance by citizenship - at the end of the year
Open Research DataThe data from the Central Register of Insureds indicate that the number of individuals who were subject to retirement and disability insurance and who had citizenship other than Polish increased from 65,000 in December 2008 to nearly 570 thousand in December 2018 (table 4 and figure 4). This means a nearly 9-time increase, while the number of foreigners...
-
The number of active enterprises in Poland in 1997-2014
Open Research DataAfter Poland joined the group of countries associated in the European Union and through participation in numerous economic and political organizations (including the World Trade Organization, OECD), as well as the commencement of trade exchange with virtually all countries of the world, Polish entrepreneurs and managers struggle with completely problems...
-
Share of gross value added generated by enterprises in GDP
Open Research DataAfter Poland joined the group of countries associated in the European Union and through participation in numerous economic and political organizations (including the World Trade Organization, OECD), as well as the commencement of trade exchange with virtually all countries of the world, Polish entrepreneurs and managers struggle with completely problems...
-
Employment structure by enterprise size in Poland in 2010-2014
Open Research DataMicro, small and medium-sized enterprises employ in total nearly 70% of all employees working in the corporate sector. Micro enterprises play a decisive role in this respect, accounting for nearly 40% of all employees. This dataset contains data showing the structure of the number of employees in enterprises in 2010-2014.
-
The structure of the enterprise sector by size in Poland and the EU-28 in 2017
Open Research DataThe majority (99.8%) of companies in the EU countries are micro, small and medium-sized enterprises - see chart. The situation is similar in Poland, but the structure of the SME sector is slightly different from that observed in the EU. In Poland, the share of micro-enterprises in the total number of enterprises is higher than in the EU countries (95.5%...
-
Iterative Global Sensitivity Analysis Algorithm with Neural Network Surrogate Modeling
PublicationGlobal sensitivity analysis (GSA) is a method to quantify the effect of the input parameters on outputs of physics-based systems. Performing GSA can be challenging due to the combined effect of the high computational cost of each individual physics-based model, a large number of input parameters, and the need to perform repetitive model evaluations. To reduce this cost, neural networks (NNs) are used to replace the expensive physics-based...
-
Weakly connected Roman domination in graphs
PublicationA Roman dominating function on a graph G=(V,E) is defined to be a function f :V → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v)=2. A dominating set D⊆V is a weakly connected dominating set of G if the graph (V,E∩(D×V)) is connected. We define a weakly connected Roman dominating function on a graph G to be a Roman dominating function such that the set...
-
Shape and force control of cable structures with minimal actuators and actuation
PublicationShape adjustment and stress control can be considered as one of the effective parameters in prestressed cable structures since such structures are widely constructed nowadays due to their characteristics. The assembly errors and applied loads hugely affect the cables’ nodal positions and stress due to their delicacy. The former could disturb the shape, which affects the appearance and the function of the structure. In contrast,...
-
Association of Genes Related to Oxidative Stress with the Extent of Coronary Atherosclerosis
PublicationOxidative stress is believed to play a critical role in atherosclerosis initiation and progression. In line with this, in a group of 1099 subjects, we determined eight single nucleotide polymorphisms (SNPs) related to oxidative stress (PON1 c.575A>G, MPO c.463G>A, SOD2 c.47T>C, GCLM c.590C>T, NOS3 c.894G>T, NOS3 c.786T>C, CYBA c.214C>T, and CYBA c.932A>G) and assessed the extent of atherosclerosis in coronary arteries based on...
-
Students and graduates of higher education institutions in 1990-2011 (with foreigners) in Poland
Open Research DataIn the last thirty years, there has been a spontaneous development of science and economy, with particular emphasis on the non-public education sector. It seems that the situation in the higher education market has now stabilized,with a slight downward trend in absolute terms.