Results 31 to 40 of about 1,773 (109)
Veterinary Dermatology, Volume 27, Issue 5, Page 391-e98, October 2016., 2016 Background– Pseudomonas aeruginosa (PA) may cause suppurative otitis externa with severe inflammation and ulceration in dogs. Multidrug resistance is commonly reported for this organism, creating a difficult therapeutic challenge. Objective– The aim of this study was to evaluate the in vitro antimicrobial activity of a gel containing 0.5 µg/mL of ...
Giovanni Ghibaudo +6 more
wiley +1 more source
Packing Coloring of Some Undirected and Oriented Coronae Graphs
Discussiones Mathematicae Graph Theory, 2017 The packing chromatic number χρ(G) of a graph G is the smallest integer k such that its set of vertices V(G) can be partitioned into k disjoint subsets V1, . . . , Vk, in such a way that every two distinct vertices in Vi are at distance greater than i in
Laïche Daouya +2 more
doaj +1 more source
On resolving edge colorings in graphs
International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 46, Page 2947-2959, 2003., 2003 We study the relationships between the resolving edge chromatic number and other graphical parameters and provide bounds for the resolving edge chromatic number of a connected graph.
Varaporn Saenpholphat, Ping Zhang
wiley +1 more source
Discussiones Mathematicae Graph Theory, 2018 In 1940, Lebesgue proved that every 3-polytope contains a 5-vertex for which the set of degrees of its neighbors is majorized by one of the following sequences: (6, 6, 7, 7, 7), (6, 6, 6, 7, 9), (6, 6, 6, 6, 11), (5, 6, 7, 7, 8), (5, 6, 6, 7, 12), (5, 6,
Borodin Oleg V. +2 more
doaj +1 more source
Homomorphism and sigma polynomials
International Journal of Mathematics and Mathematical Sciences, Volume 18, Issue 4, Page 653-658, 1995., 1995 By establishing a connection between the sigma polynomial and the homomorphism polynomial, many of the proofs for computing the sigma polynmial are simplified, the homomorphism polynomial can be identified for several new classes of graphs, and progress can be made on identifying homomorphism polynomials.
Richard Alan Gillman
wiley +1 more source
On the Palette Index of Complete Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2018 The palette of a vertex x of a graph G determined by a proper edge colouring φ of G is the set {φ(xy) : xy ∈ E(G)} and the diversity of φ is the number of different palettes determined by φ. The palette index of G is the minimum of diversities of φ taken
Horňák Mirko, Hudák Juraj
doaj +1 more source
Bounds and Complexity for the Tessellation Problem
Matemática Contemporânea, 2017 Given a graph Γ = (V,E), a tessellation T is a partition of V into cliques so that the union of the cliques covers the vertex set V but not necessarily the edge set E. A graph Γ is t-tessellable if we can cover the edge set E with t tessellations.
A. Abreu +7 more
semanticscholar +1 more source
Homomorphisms and related contractions of graphs
International Journal of Mathematics and Mathematical Sciences, Volume 11, Issue 1, Page 95-100, 1988., 1986 For every homomorphism ϕ of a graph G there exists a contraction θϕ on , the complement of G. Here we study the graph equation . In the course of our work we show that Hadwiger′s Conjecture is true for every self‐complementary graph.
Robert D. Girse, Richard A. Gillman
wiley +1 more source
Two-distance vertex-distinguishing index of sparse graphs
Open Mathematics, 2023 The two-distance vertex-distinguishing index χd2′(G){\chi }_{d2}^{^{\prime} }\left(G) of graph GG is defined as the smallest integer kk, for which the edges of GG can be properly colored using kk colors.
He Zhengyue, Liang Li, Gao Wei
doaj +1 more source
Homomorphisms of complete n‐partite graphs
International Journal of Mathematics and Mathematical Sciences, Volume 9, Issue 1, Page 193-195, 1986., 1985 It is shown that for every homomorphism ϕ of a graph G there exists a contraction θϕ on , the complement of G, such that if and only if G is a complete n‐partite graph.
Robert D. Girse
wiley +1 more source