Wyszukiwarka
Wyniki wyszukiwania dla: UPPER TOTAL DOMINATION NUMBER
-
All graphs with restrained domination number three less than their order
PublikacjaW 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
Dane BadawczeIn 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.
Dane BadawczeThe 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
PublikacjaA 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...
-
Valence state of Manganium in a MnCoO ceramics
Dane BadawczeManganium -cobalt based ceramics materials were produced by solid state reaction and sintred in a furnance in air atmosphere for 20h. Annealing temperature was 600 Celsius degree. For investigations a series of samples, with a various composition was chosen: MnCoO, Mn, Co2O and Mn2CoO. In order to determine valence states of the Mn, X-Ray photoemission...
-
Microbiological Survey in Two Arctic Fjords: Total Bacterial Number and Biomass Comparison of Hornsund and Kongsfjorden
Publikacja -
Some Progress on Total Bondage in Graphs
PublikacjaThe 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.
-
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...
-
Domination subdivision and domination multisubdivision numbers of graphs
PublikacjaThe domination subdivision number sd(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of G. It has been shown [10] that sd(T)<=3 for any tree T. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the domination multisubdivision number...
-
On the connected and weakly convex domination numbers
PublikacjaIn 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...
-
Paired domination subdivision and multisubdivision numbers of graphs
PublikacjaThe paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...
-
2-outer-independent domination in graphs
PublikacjaWe 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
PublikacjaThe 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.
-
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...
-
On trees with equal 2-domination and 2-outer-independent domination numbers
PublikacjaFor 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
PublikacjaIf $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}...
-
Wojciech Litwin dr hab. inż.
Osoby1992÷1996 – Studia na Wydziale Mechanicznym Politechniki Gdańskiej1996 – Zatrudniony na Wydziale Oceanotechniki i Okrętownictwa PG2004 – Obrona pracy doktorskiej2014 – obrona rozprawy habilitacyjnej2012 – obejmuje funkcję prodziekan ds. Nauki na Wydziale Oceanotechniki i OkrętownictwaUczestniczył w wielu projektach badawczych oraz pracach zleconych przez przemysł związanych z łożyskowaniem ślizgowym wałów głównych oraz niekonwencjonalnymi...
-
Super Dominating Sets in Graphs
PublikacjaIn 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
PublikacjaAn 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...
-
Shape and force control of cable structures with minimal actuators and actuation
PublikacjaShape 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,...
-
Infinite chromatic games
PublikacjaIn the paper we introduce a new variant of the graph coloring game and a new graph parameter being the result of the new game. We study their properties and get some lower and upper bounds, exact values for complete multipartite graphs and optimal, often polynomial-time strategies for both players provided that the game is played on a graph with an odd number of vertices. At the end we show that both games, the new and the classic...
-
Cops, a fast robber and defensive domination on interval graphs
PublikacjaThe 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”,...
-
The searchlight problem for road networks
PublikacjaWe consider the problem of searching for a mobile intruder hiding in a road network given as the union of two or more lines, or two or more line segments, in the plane. Some of the intersections of the road network are occupied by stationary guards equipped with a number of searchlights, each of which can emit a single ray of light in any direction along the lines (or line segments) it is on. The goal is to detect the intruder,...
-
Janusz Nieznański prof. dr hab. inż.
OsobyUrodził się w 1957 r. w Gdańsku. Jest absolwentem Wydziału Elektrycznego Politechniki Gdańskiej (1981). W 1990 r. uzyskał stopień doktora, w 1999 r. stopień doktora habilitowanego, a w 2015 r. tytuł profesora. Jest pracownikiem naukowo-dydaktycznym Politechniki Gdańskiej nieprzerwanie od ukończenia studiów. Jego zainteresowania naukowe obejmują sterowanie, diagnostykę, modelowanie i symulację układów energoelektronicznych i napędowych,...
-
An Application Supporting Gastroesophageal Multichannel Intraluminal Impedance-pH Analysis
PublikacjaDue to a significant rise in the number of patients diagnosed with diseases of the upper gastrointestinal tract and the high cost of treatment, there is a need to further research on one of the most popular diagnostic tests used in this case – esophageal Multichannel Intraluminal Impedance and pH measurement. This may lead to finding new diagnostically relevant information, used to quicken and improve the diagnostic procedure....
-
Some variations of perfect graphs
PublikacjaWe 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
Dane BadawczeThe 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
PublikacjaThe 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.
-
Graphs with isolation number equal to one third of the order
PublikacjaA set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...
-
Paweł Burdziakowski dr inż.
Osobydr inż. Paweł Burdziakowski jest specjalista w zakresie fotogrametrii i teledetekcji lotniczej niskiego pułapu, nawigacji morskiej i lotniczej. Jest również licencjonowanym instruktorem lotniczym oraz programistą. Głównymi obszarami zainteresowania jest fotogrametria cyfrowa, nawigacja platform bezzałogowych oraz systemy bezzałogowe, w tym lotnicze, nawodne, podwodne. Prowadzi badania w zakresie algorytmów i metod poprawiających...
-
Bipartite theory of graphs: outer-independent domination
PublikacjaLet $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...
-
Tight bounds on global edge and complete alliances in trees
PublikacjaIn the talk the authors present some tight upper bounds on global edge alliance number and global complete alliance number of trees. Moreover, we present our NP-completeness results from [8] for global edge alliances and global complete alliances on subcubic bipartite graphs without pendant vertices. We discuss also polynomial time exact algorithms for finding the minimum global edge alliance on trees [7] and complete alliance...
-
2-bondage in graphs
PublikacjaA 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
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 bank branches per million inhabitants in EU countries 2015
Dane BadawczeAccording 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...
-
Host and pathogen factors in Klebsiella pneumoniae upper urinary tract infections in renal transplant patients
PublikacjaPurpose . To analyse the role of virulence factors (VFs) and host in Klebsiella pneumoniae upper urinary tract infections (UTIs) in renal transplant (RTx) recipients. Methodology. Clinical and demographic data were registered prospectively. Phylogenetic background of K. pneumoniae isolates was analysed by PCR melting profiles (MP) and the following VFs genes: fimH-1, uge, kpn, ycfM, mrkD, rmpA, magA, hlyA, cnf-1, irp-1, irp-2,...
-
Number of own bank branches (2017)
Dane BadawczeThe 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...
-
Interval incidence graph coloring
PublikacjaIn this paper we introduce a concept of interval incidence coloring of graphs and survey its general properties including lower and upper bounds on the number of colors. Our main focus is to determine the exact value of the interval incidence coloring number χii for selected classes of graphs, i.e. paths, cycles, stars, wheels, fans, necklaces, complete graphs and complete k-partite graphs. We also study the complexity of the...
-
On the 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...
-
On some Zarankiewicz numbers and bipartite Ramsey Numbers for Quadrilateral
PublikacjaThe Zarankiewicz number z ( m, n ; s, t ) is the maximum number of edges in a subgraph of K m,n that does not contain K s,t as a subgraph. The bipartite Ramsey number b ( n 1 , · · · , n k ) is the least positive integer b such that any coloring of the edges of K b,b with k colors will result in a monochromatic copy of K n i ,n i in the i -th color, for some i , 1 ≤ i ≤ k . If n i = m for all i , then we denote this number by b k ( m )....
-
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
PublikacjaThis 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)...
-
Computationally Efficient Multi-Objective Optimization of and Experimental Validation of Yagi-Uda Antenna
PublikacjaIn this paper, computationally efficient multi-objective optimization of antenna structures is discussed. As a design case, we consider a multi-parameter planar Yagi-Uda antenna structure, featuring a driven element, three directors, and a feeding structure. Direct optimization of the high-fidelity electromagnetic (EM) antenna model is prohibitive in computational terms. Instead, our design methodology exploits response surface...
-
Equitable coloring of corona products of graphs
PublikacjaIn this paper we consider an equitable coloring of some corona products of graphs G and H in symbols, G o H). In particular, we show that deciding the colorability of G o H is NP-complete even if G is 4-regular and H is K_2. Next, we prove exact values or upper bounds on the equitable chromatic number of G o H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a path, a cycle or a complete graph.
-
The structure of the Polish banking sector in 2004-2018
Dane BadawczeDynamic 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
Dane BadawczeIn 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 bondage in graphs
PublikacjaA 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')...
-
Non-isolating 2-bondage in graphs
PublikacjaA 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)....
-
Number of students per one lecturer in the academic year 2010/2011 at Polish univeristies
Dane BadawczeAs 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%....
-
Structure of the Resource Theory of Quantum Coherence
PublikacjaQuantum coherence is an essential feature of quantum mechanics which is responsible for the departure between the classical and quantum world. The recently established resource theory of quantum coherence studies possible quantum technological applications of quantum coherence, and limitations that arise if one is lacking the ability to establish superpositions. An important open problem in this context is a simple characterization...
-
Areas of updraft air motion from WRF model simulations.
Dane BadawczePresented 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...