Results 21 to 30 of about 1,012 (122)
Long-Scale Ollivier Ricci Curvature of Graphs
Analysis and Geometry in Metric Spaces, 2019 We study the long-scale Ollivier Ricci curvature of graphs as a function of the chosen idleness. Similarly to the previous work on the short-scale case, we show that this idleness function is concave and piecewise linear with at most 3 linear parts.
Cushing D., Kamtue S.
doaj +1 more source
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
Improved Bounds for Some Facially Constrained Colorings
Discussiones Mathematicae Graph Theory, 2023 A facial-parity edge-coloring of a 2-edge-connected plane graph is a facially-proper edge-coloring in which every face is incident with zero or an odd number of edges of each color. A facial-parity vertex-coloring of a 2-connected plane graph is a proper
Štorgel Kenny
doaj +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
A subexponential construction of graph coloring for multiparty computation
Journal of Mathematical Cryptology, 2014 We show the first deterministic construction of an unconditionally secure multiparty computation (MPC) protocol in the passive adversarial model over black-box non-Abelian groups which is both optimal (secure against an adversary who possesses any ...
Asghar Hassan Jameel +3 more
doaj +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
Flippable Edges in Triangulations on Surfaces
Discussiones Mathematicae Graph Theory, 2022 Concerning diagonal flips on triangulations, Gao et al. showed that any triangulation G on the sphere with n ≥ 5 vertices has at least n − 2 flippable edges.
Ikegami Daiki, Nakamoto Atsuhiro
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
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 +5 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 +3 more
doaj +1 more source