Results 11 to 20 of about 262 (128)
Abstract Background Pseudomonas aeruginosa is the most commonly isolated bacterium from skin lesions of dogs with post‐grooming furunculosis (PGF). It is frequently found in human hair and skin care products, and may pose a health risk to consumers. Information regarding the prevalence of P. aeruginosa contamination of dog grooming products is lacking.
Elad Perry +5 more
wiley +1 more source
Background – Because of the increased incidence of multidrug‐resistant (MDR) bacteria, the use of disinfectants over antibiotics has been encouraged. However, the interactions between disinfectants and host local immunity are poorly understood. Objective – To assess the effects of chlorhexidine digluconate (Chx), with and without selected host defence ...
Domenico Santoro +3 more
wiley +1 more source
Coloring the Voronoi tessellation of lattices
Abstract In this paper we define the chromatic number of a lattice: It is the least number of colors one needs to color the interiors of the cells of the Voronoi tessellation of a lattice so that no two cells sharing a facet are of the same color. We compute the chromatic number of the root lattices, their duals, and of the Leech lattice, we consider ...
Mathieu Dutour Sikirić +3 more
wiley +1 more source
Малки неравномерни хиперграфи без свойство B [PDF]
[Cherkashin Danila; Черкашин Данила]2020 Mathematics Subject Classification: 05C15 ...
Cherkashin, Danila
core
Radio Number Of Wheel Like Graphs [PDF]
In this paper we establish the radio number for Flower Wheel graph (F Wk n), k-Wheel graph (kW ) and Joint-Wheel graph(W Hn). AMS Subject classification: 05C78 (05C15)
A. A. Bhatti∗, Aster Nisar∗, Maria Kanwal∗ +1 more
core +1 more source
The Strong 3-Rainbow Index of Graphs Containing Three Cycles [PDF]
The concept of a strong k-rainbow index is a generalization of a strong rainbow connection number, which has an interesting application in security systems in a communication network.
Zata Yumni Awanis
core +2 more sources
The Distinguishing Number and Distinguishing Index of the Lexicographic Product of Two Graphs
The distinguishing number (index) D(G) (D′(G)) of a graph G is the least integer d such that G has a vertex labeling (edge labeling) with d labels that is preserved only by the trivial automorphism.
Alikhani Saeid, Soltani Samaneh
doaj +1 more source
Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs
Two distinct crossings are independent if the end-vertices of the crossed pair of edges are mutually different. If a graph G has a drawing in the plane such that every two crossings are independent, then we call G a plane graph with independent crossings
Song Wen-Yao +2 more
doaj +1 more source
Coloring of the d th Power of the Face-Centered Cubic Grid
The face-centered cubic grid is a three dimensional 12-regular infinite grid. This graph represents an optimal way to pack spheres in the three-dimensional space.
Gastineau Nicolas, Togni Olivier
doaj +1 more source
2-Distance Colorings of Integer Distance Graphs
A 2-distance k-coloring of a graph G is a mapping from V (G) to the set of colors {1,. . ., k} such that every two vertices at distance at most 2 receive distinct colors.
Benmedjdoub Brahim +2 more
doaj +1 more source

