Wyszukiwarka
Filtry
wszystkich: 87
wybranych: 85
-
Katalog
Filtry wybranego katalogu
Wyniki wyszukiwania dla: TOTAL DOMINATION
-
Interpolation properties of domination parameters of a graph
PublikacjaAn integer-valued graph function π is an interpolating function if a set π(T(G))={π(T): T∈TT(G)} consists of consecutive integers, where TT(G) is the set of all spanning trees of a connected graph G. We consider the interpolation properties of domination related parameters.
-
Restrained differential of a graph
PublikacjaGiven a graph $G=(V(G), E(G))$ and a vertex $v\in V(G)$, the {open neighbourhood} of $v$ is defined to be $N(v)=\{u\in V(G) :\, uv\in E(G)\}$. The {external neighbourhood} of a set $S\subseteq V(G)$ is defined as $S_e=\left(\cup_{v\in S}N(v)\right)\setminus S$, while the \emph{restrained external neighbourhood} of $S$ is defined as $S_r=\{v\in S_e : N(v)\cap S_e\neq \varnothing\}$. The restrained differential of a graph $G$ is...
-
Preface of guest editors
PublikacjaA special issue of Discussiones Mathematice Graph Theory (DMGT) is dedicated to selected papers presented at the 12th Workshop on Graph Theory: Colourings, Independence and Domination (CID) held on 16-21 September 2007 in Karpacz, Poland. It continues a series of international workshops: 1993-1997 in Lubiatów, 1998-2001 in Gronów, 2003 and 2005 in Karpacz. About 70 participants formed the audience of six invited lectures and 68...
-
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
PublikacjaGiven two types of graph theoretical parameters ρ and σ, we say that a graph G is (σ, ρ)- perfect if σ(H) = ρ(H) for every non-trivial connected induced subgraph H of G. In this work we characterize (γw, τ )-perfect graphs, (γw, α′)-perfect graphs, and (α′, τ )-perfect graphs, where γw(G), τ (G) and α′(G) denote the weakly connected domination number, the vertex cover number and the matching number of G, respectively. Moreover,...
-
An upper bound on the 2-outer-independent domination number of a tree
PublikacjaA 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,...
-
Bounds on the vertex-edge domination number of a tree
PublikacjaA vertex-edge dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every edge of $G$ is incident with a vertex of $D$ or a vertex adjacent to a vertex of $D$. The vertex-edge domination number of a graph $G$, denoted by $\gamma_{ve}(T)$, is the minimum cardinality of a vertex-edge dominating set of $G$. We prove that for every tree $T$ of order $n \ge 3$ with $l$ leaves and $s$ support vertices we have $(n-l-s+3)/4...
-
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...
-
Quantum strategies for rendezvous and domination tasks on graphs with mobile agents
PublikacjaThis paper explores the application of quantum nonlocality, a renowned and unique phenomenon acknowledged as a valuable resource. Focusing on an alternative application, we demonstrate its quantum advantage for mobile agents engaged in specific distributed tasks without communication. The research addresses the significant challenge of rendezvous on graphs and introduces a distributed task for mobile agents grounded in the graph...
-
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...
-
Public spaces connecting cities. Green and Blue Infrastructures potential.
PublikacjaA city fragmentation causes a lot of negative effects in urban environment such as: disconnecting the environmental, functional and compositional relations, a loss of urban compactness, chaotic development, visual chaos, a domination of technical landscape, reduction of security. This is why one of main challenges for urban planners is to connect the fragmented structures by creating friendly, attractive and safe public space....
-
An upper bound for the double outer-independent domination number of a tree
PublikacjaA 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...
-
Preface
PublikacjaThis special issue of Discussiones Mathematice Graph Theory (DMGT) is dedicated to selected papers presented at the 13th Workshop on Graph Theory: Colourings, Independence and Domination (CID) held on 18-23 September 2009 in Szklarska Poręba, Poland. It continues a series of international workshops: 1993-1997 in Lubiatów, 1998-2001 in Gronów, and 2003-2007 in Karpacz. The meeting was organized by the Faculty of Mathematics, Computer...
-
Isolation Number versus Domination Number of Trees
PublikacjaIf G=(VG,EG) is a graph of order n, we call S⊆VG an isolating set if the graph induced by VG−NG[S] contains no edges. The minimum cardinality of an isolating set of G is called the isolation number of G, and it is denoted by ι(G). It is known that ι(G)≤n3 and the bound is sharp. A subset S⊆VG is called dominating in G if NG[S]=VG. The minimum cardinality of a dominating set of G is the domination number, and it is denoted by γ(G)....
-
A lower bound on the double outer-independent domination number of a tree
PublikacjaA 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...
-
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublikacjaA vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...
-
Numerical modeling of exciton impact in two crystalographic phases of the organo-lead halide perovskite (CH3NH3PbI3) solar cell
PublikacjaTo improve the power conversion efficiency of solar cells based on organo–lead halide perovskites, a detailed understanding of the device physics is fundamental. Here, a computational analysis of excitons impact is reported for these types of photocell. Numerical calculations based on the model, which take into account electronic charge carriers (electrons and holes), excitons and ions, have been carried out. The role of excitons...
-
Weakly connected Roman domination in graphs
PublikacjaA 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...
-
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|...
-
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...
-
Activation of peroxymonosulfate using carbon black nano-spheres/calcium alginate hydrogel matrix for degradation of acetaminophen: Fe3O4 co-immobilization and microbial community response
PublikacjaHerein, we focused on the degradation of acetaminophen (ACT) drug in liquid phase by peroxymonosulfate (PMS) activated by carbon black nano-spheres (CBNS). The nanostructured activator was immobilized into calcium alginate hydrogel matrix (CAHM) to avoid the washout of the fine nanostructures. The Langmuir modeling showed an insignificant contribution to the adsorption process in the removal of ACT. The basic pH conditions favored...
-
Pressure drop and heat transfer during boiling and condensation at subcritical region
PublikacjaMost of the data presented in the literature relate to saturation temperatures in the range - 20°C to 40°C due to the application in refrigeration technology. There is necessity to extend databases to higher values of saturation temperature due to new applications such as Organic Rankine Cycle and high temperature heat pumps. Only few papers contain data for high reduced pressure for low boiling point liquids. This paper focus...
-
Current status and future success of renewable energy in Pakistan
PublikacjaMismatch between energy demand and supply from last two decades has been increasing because of the domination of expensive imported oil in energy mix of Pakistan. To import crude oil Government paid US $ 9 billion in 2008–2009 to meet the energy demands...
-
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...
-
Unexpected Z/E isomerism of N-methyl-O-phosphothioyl benzohydroxamic acids, their oxyphilic reactivity and inertness to amines
PublikacjaThiophosphinoylation of N-methyl p-substituted benzohydroxamic acids using disulfanes (method A) or diphenylphosphinothioyl chloride (method B) provides only one conformer of the respective O-phosphothioyl derivative (Xray and NMR analysis). Undergoing the P-transamidoxylation reaction is an evidence of the reversibility of thiophosphinoylation. Only those products containing strong EWG substituents in the aroyl residue or bulky...
-
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)....
-
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')...
-
Mutual Interaction between Temperature and DO Set Point on AOB and NOB Activity during Shortcut Nitrification in a Sequencing Batch Reactor in Terms of Energy Consumption Optimization
PublikacjaRecently, many wastewater treatment plants (WWTPs) have had to deal with serious problems related to the restrictive requirements regarding the euent quality, as well as significant energy consumption associated with it. In this situation, mainstream deammonification and/or shortened nitrification-denitrification via nitrite (so-called “nitrite shunt”) is a new promising strategy. This study shows the mechanisms and operating conditions...
-
Theoretical modelling of efficient fire safety water networks by certified domination
PublikacjaThis paper explores a new way of designing water supply networks for fire safety using ideas from graph theory, focusing on a method called certified domination. Ensuring a good water supply is crucial for fire safety in communities, this study looks at the rules and problems in Poland for how much water is needed to fight fires in different areas and how this can be achieved at a lowest possible cost. We present a way to plan...
-
The Urban Mentoring as a New Method of Participatory Urban Planning in Poland
PublikacjaTwenty-five years after the return of democracy and the beginning of basing the country's economy on neoliberal developmental paradigm, Poland adopted the regulations regarding management of urban policy, which had been wait for over a decade (accession to the EU). The National Urban Policy as well as the Act on revitalization have defined, in a modern manner, the field of cooperation between the local government, the administration...
-
Persulfates to degrade a mixture of dyes (rhodamine B, methylene blue) in the presence of glucose and visible light
PublikacjaA treatment process utilizing visible-light-activated (Vis) persulfates (PS) in the presence of an organic promoter (glucose) was developed for the simultaneous decolorization of a rhodamine B (RhB) and methylene blue (MB) mixture. Various doses of glucose, PS concentrations, pH values, initial dye concentrations and process time were tested to find out the most appropriate parameters for degrading the RhB/MB mixture in the...
-
Modelling AOB-NOB competition in shortcut nitrification compared with conventional nitrification-denitrification process
PublikacjaIn particular, mainstream deammonification and/or shortened nitrificationdenitrification via nitrite (so-called “nitrite shunt”) is a promising new treatment concept that has the potential to revolutionise how nitrogen removal is achieved at WWTPs. Understanding the role of the AOB/NOB competition in the nitrogen cycle in wastewater treatment systems will change operational strategies of the novel nitrogen removal processes. The...
-
Noise Analysis of Continuous GPS Time Series of Selected EPN Stations to Investigate Variations in Stability of Monument Types
PublikacjaThe type of monument that a GPS antenna is placed on plays a significant role in noise estimation for each permanent GPS station. In this research 18 Polish permanent GPS stations that belong to the EPN (EUREF Permanent Network) were analyzed using Maximum Likelihood Estimation (MLE). The antennae of Polish EPN stations are placed on roofs of buildings or on concrete pillars. The analyzed data covers a period of 5 years from 2008...
-
THE INFLUENCE OF WATER-LAND RELATIONS ON THE LANDSCAPE AND ARCHITECTURE OF THE VISTULA DELTA (POLAND)
PublikacjaThe Vistula Delta is unique region of water domination. In this part of Europe, historic rural assumptions have been developing since the 12th century. Practically, it can be said that most of the systems were related to the coexistence of the human and the water element. Relations of water and land, developed specific types of villages such as a water-based village. Water landscape; polders, canals, dikes and rivers, hydro-technical...
-
5-Selenocyanato and 5-trifluoromethanesulfonyl derivatives of 2′-deoxyuridine: synthesis, radiation and computational chemistry as well as cytotoxicity
Publikacja5-Selenocyanato-2′-deoxyuridine (SeCNdU) and 5-trifluoromethanesulfonyl-2′-deoxyuridine (OTfdU) have been synthesized and their structures have been confirmed with NMR and MS methods. Both compounds undergo dissociative electron attachment (DEA) when irradiated with X-rays in an aqueous solution containing a hydroxyl radical scavenger. The DEA yield of SeCNdU significantly exceeds that of 5-bromo-2′-deoxyuridine (BrdU), remaining...
-
Experimental and theoretical study of a vertical tube in shell storage unit with biodegradable PCM for low temperature thermal energy storage applications
PublikacjaThis article presents the experimental investigations of the coconut oil-based TES module for HVAC applications in the ambient and-sub ambient temperature range. To properly study this problem modular experimental module and test loop were developed. Special attention has been paid to study the physical mechanism of the melting/solidification process for natural substance (coconut oil) which has perspectives to be used in thermal...