Results 21 to 30 of about 132 (112)

A Note on the Upper Bounds on the Size of Bipartite and Tripartite 1-Embeddable Graphs on Surfaces

Discussiones Mathematicae Graph Theory, 2023
In this note, we show sharp upper bounds of the size of simple bipartite and tripartite 1-embeddable graphs on closed surfaces.
Shibuya Hikari, Suzuki Yusuke
doaj   +1 more source

In vitro antimicrobial activity of a gel containing antimicrobial peptide AMP2041, chlorhexidine digluconate and Tris‐EDTA on clinical isolates of Pseudomonas aeruginosa from canine otitis

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, Davide Santospirito, Andrea Sala, Sara Flisi, Simone Taddei, Sandro Cavirani, Clotilde Silvia Cabassi   +6 more
wiley   +1 more source

Characteristic polynomials of some weighted graph bundles and its application to links

International Journal of Mathematics and Mathematical Sciences, Volume 17, Issue 3, Page 503-510, 1994., 1994
In this paper, we introduce weighted graph bundles and study their characteristic polynomial. In particular, we show that the characteristic polynomial of a weighted ‐bundles over a weighted graph G? can be expressed as a product of characteristic polynomials two weighted graphs whose underlying graphs are G As an application, we compute the signature ...
Moo Young Sohn, Jaeun Lee
wiley   +1 more source

Generalized Ramsey numbers for paths in 2‐chromatic graphs

International Journal of Mathematics and Mathematical Sciences, Volume 9, Issue 2, Page 273-276, 1986., 1985
Chung and Liu have defined the d‐chromatic Ramsey number as follows. Let 1 ≤ d ≤ c and let . Let 1, 2, …, t be the ordered subsets of d colors chosen from c distinct colors. Let G1, G2, …, Gt be graphs. The d‐chromatic Ramsey number denoted by is defined as the least number p such that, if the edges of the complete graph Kp are colored in any fashion ...
R. Meenakshi, P. S. Sundararaghavan
wiley   +1 more source

Relaxed DP-Coloring and another Generalization of DP-Coloring on Planar Graphs without 4-Cycles and 7-Cycles

Discussiones Mathematicae Graph Theory, 2023
DP-coloring is generalized via relaxed coloring and variable degeneracy in [P. Sittitrai and K. Nakprasit, Su cient conditions on planar graphs to have a relaxed DP-3-coloring, Graphs Combin. 35 (2019) 837–845], [K.M. Nakprasit and K.
Sribunhung Sarawute, Nakprasit Keaitsuda Maneeruk, Nakprasit Kittikorn, Sittitrai Pongpat   +3 more
doaj   +1 more source

The Crossing Numbers of Join of Some Graphs with n Isolated Vertices

Discussiones Mathematicae Graph Theory, 2018
There are only few results concerning crossing numbers of join of some graphs. In this paper, for some graphs on five vertices, we give the crossing numbers of its join with n isolated vertices.
Ding Zongpeng, Huang Yuanqiu
doaj   +1 more source

Effect of Gabapentin Administered With Prednisolone, Ciclosporin or a Placebo on Clinical Outcomes and Motor Activity in Cats With Atopic Skin Syndrome: A Prospective, Blinded, Placebo‐Controlled Study

Veterinary Dermatology, Volume 36, Issue 6, Page 814-824, December 2025.
Background: Gabapentin reportedly decreases central sensitisation, a disorder associated with chronic pruritus in humans, although this is not well documented in cats. Its combined use with the standard antipruritic therapy for feline atopic skin syndrome (FASS) is not yet described.
Jeanne Morency, Éric Troncy, Aliénor Delsart, Colombe Otis, Jérôme R. E. Del Castillo, Andrea Gonzales, Jason Ross, Maxim Moreau, Jean‐Pierre Pelletier, Johanne Martel‐Pelletier, Frédéric Sauvé   +10 more
wiley   +1 more source

Facial [r,s,t]-Colorings of Plane Graphs

Discussiones Mathematicae Graph Theory, 2019
Let G be a plane graph. Two edges are facially adjacent in G if they are consecutive edges on the boundary walk of a face of G. Given nonnegative integers r, s, and t, a facial [r, s, t]-coloring of a plane graph G = (V,E) is a mapping f : V ∪ E → {1, . .
Czap Július, Šugerek Peter, Jendrol’ Stanislav, Valiska Juraj   +3 more
doaj   +1 more source

Efficacy and field safety of ilunocitinib for the control of atopic dermatitis in client‐owned dogs: A multicentre, double‐masked, randomised, placebo‐controlled clinical trial

Veterinary Dermatology, Volume 36, Issue 5, Page 647-659, October 2025.
Background – Inhibition of the Janus kinase (JAK) pathway is a well‐established option for canine atopic dermatitis (cAD). Objective – To evaluate the efficacy and safety of ilunocitinib, a novel JAK inhibitor for the control of pruritus and skin lesions in client‐owned dogs with cAD.
Sophie Forster, Candace M. Trout, Simona Despa, Annette Boegel, Darren Berger, Stephen King   +5 more
wiley   +1 more source

Galois connections between sets of paths and closure operators in simple graphs

Open Mathematics, 2018
For every positive integer n,we introduce and discuss an isotone Galois connection between the sets of paths of lengths n in a simple graph and the closure operators on the (vertex set of the) graph.
Šlapal Josef
doaj   +1 more source