displaying 1000 best results Help
Search results for: Y-DOMINATING SET
-
República y Derecho
Journals -
Trabajos y comunicaciones
Journals -
Derecho y Humanidades
Journals -
Poblacion y Sociedad
Journals -
Temas y Debates
Journals -
Politica y Sociedad
Journals -
Sociologia y Tecnociencia
Journals -
Persona y Derecho
Journals -
Cultura y Droga
Journals -
Ingenieria y Universidad
Journals -
Signo y Pensamiento
Journals -
Propositos y Representaciones
Journals -
Contaduria y Administracion
Journals -
Desarrollo y Sociedad
Journals -
Teoria y Praxis
Journals -
Veterinaria y Zootecnia
Journals -
Historia y Política.
Journals -
Teologia y Vida
Journals -
Ciencia y Enfermeria
Journals -
Pensamiento y Cultura
Journals -
Discurso y Sociedad
Journals -
Salud y Drogas
Journals -
Trabajo y Derecho
Journals -
Produccion y Limpia
Journals -
Madera y Bosques
Journals -
POLITICA Y GOBIERNO
Journals -
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,...
-
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...
-
Bounds on the vertex-edge domination number of a tree
PublicationA 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...
-
On trees attaining an upper bound on the total domination number
PublicationA total 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. The total domination number of a graph G, denoted by γ_t(G), is the minimum cardinality of a total dominating set of G. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International Journal of Graphs and Combinatorics 1 (2004), 69-75] established the following upper bound on the total domination...
-
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...
-
Natural/bio-based sorbents as greener extractive materials for endocrine disrupting compounds in samples of different matrix composition
PublicationEndocrine-disrupting compounds (EDCs) are a group of chemicals that interfere with the endocrine system, leading to adverse effects on human health and the environment. Increasing concerns over the EDCs presence in various environmental compartments has driven the search for greener extraction materials. Recently, the use of polymers of natural origin (biopolymers) has been demonstrated to be an effective and promising research...
-
Investigation of cationic distribution, Y–K angles, and optical and dielectric properties of as-synthesized cerium-doped cobalt nano-ferrites prepared by co-precipitation method
Publication -
Paired domination versus domination and packing number in graphs
PublicationGiven a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ (G), γpr(G), and γt(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and...
-
Dirac fermions and possible weak antilocalization in LaCuSb2
PublicationLayered heavy-metal square-lattice compounds have recently emerged as potential Dirac fermion materials due to bonding within those sublattices. We report quantum transport and spectroscopic data on the layered Sb square-lattice material LaCuSb2. Linearly dispersing band crossings, necessary to generate Dirac fermions, are experimentally observed in the electronic band structure observed using angle-resolved photoemission spectroscopy,...
-
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...
-
Implementation mechanism of impact investing in the post-conflict regions
Publication -
ЯКІСТЬ МЕДИЧНИХ ПОСЛУГ: ЕКОНОМІЧНА СУТНІСТЬ ТА ІНТЕРПРЕТАЦІЯ
Publication -
TRANSFORMATION OF DIGITALIZATION ON THE FINANCIAL AND INSURANCE MARKET
Publication -
The Effect of Cryogenic Treatment on Microstructure and Mechanical Response of AISI D3 Tool Steel Punches
PublicationRecently, deep cryogenic treatment is performed to improve the mechanical responses (wear, hardness, fatigue, and thermal conductivity) of various steel components. Researchers have tried to evaluate the eco-friendly and nontoxic process to optimize the parameters. Cold-shearing punches used to manufacture various holes that undergo severe impact loading and wear in the metal forming process. This study concerns the effect of soaking...
-
Numerical solution of threshold problems in epidemics and population dynamics
PublicationA new algorithm is proposed for the numerical solution of threshold problems in epidemics and population dynamics. These problems are modeled by the delay-differential equations, where the delay function is unknown and has to be determined from the threshold conditions. The new algorithm is based on embedded pair of continuous Runge–Kutta method of order p = 4 and discrete Runge–Kutta method of order q = 3 which is used for the...
-
Independent Domination Subdivision in Graphs
PublicationA 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...
-
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...
-
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}...
-
Effectiveness of either short-duration ischemic pre-conditioning, single-set high-resistance exercise, or their combination in potentiating bench press exercise performance
Publication -
Simultaneous determination of hydrophobicity and dissociation constant for a large set of compounds by gradient reverse phase high performance liquid chromatography–mass spectrometry technique
Publication -
Effects of Acute Caffeine Intake on Power Output and Movement Velocity During a Multiple-Set Bench Press Exercise Among Mild Caffeine Users
Publication -
Zagospodarowanie ciepła odpadowego z biogazowych agregatów kogeneracyjnych w oczyszczalni ścieków = Waste heat utilisation from cogeneration set in sewage plant
PublicationW pracy opisano koncepcję współpracy biogazowych modułów kogeneracyjnych z niskotemperaturowym obiegiem parowym. Proponowana modernizacja pozwoliłaby na wykorzystanie entalpii fizycznej spalin, tym samym zwiększając sprawność urządzeń wytwarzających ciepło i energię elektryczną. Tego typu rozwiązanie umożliwiłoby częściowe pokrycie zapotrzebowania własnego na energię elektryczną, generując oszczędności w przedsiębiorstwie. W artykule...
-
Correction to: Investigation of cationic distribution, Y–K angles, and optical and dielectric properties of as-synthesized cerium-doped cobalt nano-ferrites prepared by co-precipitation method
Publication -
Ekspertyza konstrukcji i stanu technicznego napędu rollera rejowego, napędu rollera sztagowego oraz wózka fałowego na sztag s/y "Running on Waves"
PublicationCelem ekspertyzy było ustalenie przyczyn nieprawidłowej pracy urządzeń rejowych i wciągarek. Omówiono błędy projektowe i wykonawcze oraz wskazano przyczyny awarii. Sformułowano wnioski dotyczące kierunków modernizacji konstrukcji.