Results 11 to 20 of about 1,773 (109)
Veterinary Dermatology, Volume 33, Issue 4, Page 316-e73, August 2022., 2022 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
Veterinary Dermatology, Volume 33, Issue 1, Page 17-e6, February 2022., 2022 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
Journal of the London Mathematical Society, Volume 104, Issue 3, Page 1135-1171, October 2021., 2021 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
A categorification for the chromatic polynomial [PDF]
, 2004 For each graph we construct graded cohomology groups whose graded Euler characteristic is the chromatic polynomial of the graph. We show the cohomology groups satisfy a long exact sequence which corre- sponds to the well-known deletion-contraction rule ...
Laure Helme-Guizon, Yongwu Rong
semanticscholar +1 more source
RAINBOW CONNECTION NUMBER OF FLOWER SNARK GRAPH
, 2020 Let G be a nontrivial connected graph on which is defined a coloring c : E(G) → {1, 2, · · · , k}, k ∈ N of the edges of G, where adjacent edges may be colored the same. A path in G is called a rainbow path if no two edges of it are colored the same.
K. Rao, U. Kumar, A. Mekala
semanticscholar +1 more source
On Local Antimagic Chromatic Number of Cycle-Related Join Graphs
Discussiones Mathematicae Graph Theory, 2021 An edge labeling of a connected graph G = (V, E) is said to be local antimagic if it is a bijection f : E → {1, . . ., |E|} such that for any pair of adjacent vertices x and y, f+(x) ≠ f+(y), where the induced vertex label f+(x) = Σf(e), with e ranging ...
Lau Gee-Choon, Shiu Wai-Chee, Ng Ho-Kuen
doaj +1 more source
Coloring subgraphs with restricted amounts of hues
Open Mathematics, 2017 We consider vertex colorings where the number of colors given to specified subgraphs is restricted. In particular, given some fixed graph F and some fixed set A of positive integers, we consider (not necessarily proper) colorings of the vertices of a ...
Goddard Wayne, Melville Robert
doaj +1 more source
Wiener polarity index of quasi-tree molecular structures
, 2018 As an important branch of theoretical chemistry, chemical index calculation has received wide attention in recent years. Its theoretical results have been widely used in many fields such as chemistry, pharmacy, physics, biology, materials, etc.
Zihao Tang, L. Liang, Wei Gao
semanticscholar +1 more source
The Distinguishing Number and Distinguishing Index of the Lexicographic Product of Two Graphs
Discussiones Mathematicae Graph Theory, 2018 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
Discussiones Mathematicae Graph Theory, 2020 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