Results 21 to 30 of about 156 (133)

Long-Scale Ollivier Ricci Curvature of Graphs

open access: yesAnalysis 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

Coverings of Cubic Graphs and 3-Edge Colorability

open access: yesDiscussiones Mathematicae Graph Theory, 2021
Let h:G˜→Gh:\tilde G \to G be a finite covering of 2-connected cubic (multi)graphs where G is 3-edge uncolorable. In this paper, we describe conditions under which G˜\tilde G is 3-edge uncolorable. As particular cases, we have constructed regular and
Plachta Leonid
doaj   +1 more source

The Crossing Number of Cartesian Product of 5-Wheel with any Tree

open access: yesDiscussiones Mathematicae Graph Theory, 2021
In this paper, we establish the crossing number of join product of 5-wheel with n isolated vertices. In addition, the exact values for the crossing numbers of Cartesian products of the wheels of order at most five with any tree T are given.
Wang Yuxi, Huang Yuanqiu
doaj   +1 more source

A subexponential construction of graph coloring for multiparty computation

open access: yesJournal 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

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

open access: yesDiscussiones 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

A new monoid construction under crossed products proceedings of the international congress in honour of professor Hari M. Srivastava

open access: yes, 2013
In this paper we define a new monoid construction under crossed products for given monoids. We also present a generating set and a relator set for this product. Finally, we give the necessary and sufficient conditions for the regularity of it. MSC: 05C10,
Cangül, İ. N.   +3 more
core   +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

open access: yesVeterinary 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

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

open access: yesDiscussiones 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   +3 more
doaj   +1 more source

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

open access: yesInternational 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

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

open access: yesDiscussiones 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

Home - About - Disclaimer - Privacy