Results 31 to 40 of about 1,010 (104)
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
Intrinsic knotting and linking of complete graphs [PDF]
, 2002 We show that for every m in N, there exists an n in N such that every embedding of the complete graph K_n in R^3 contains a link of two components whose linking number is at least m. Furthermore, there exists an r in N such that every embedding of K_r in
Erica Flapan, Erica Flapan
core +5 more sources
Computational Analysis of new Degree-based descriptors of oxide networks
Open Chemistry, 2019 Oxide networks have diverse applications in the polymer and pharmaceutical industries. Polynomials and degree-based topological indices have tendencies to correlate properties of molecular graphs.
Hussain Zafar +5 more
doaj +1 more source
Veterinary Dermatology, EarlyView.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
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
Construction of planar 4-connected triangulations [PDF]
, 2014 In this article we describe a recursive structure for the class of 4-connected triangulations or - equivalently - cyclically 4-connected plane cubic ...
Brinkmann, Gunnar +3 more
core +2 more sources
Journal of Mathematics, Volume 2025, Issue 1, 2025.In its crystalline state, the α‐icosahedral nanosheet of boron demonstrates superconductivity and thermal electronic properties. Mathematical research on a graph’s structure yields a graph descriptor, a numerical measure. Chemical graph theory employs connectivity descriptors to analyze molecular structures, providing crucial insights into many ...
Khalil Hadi Hakami +3 more
wiley +1 more source
A generalization of Vassiliev's planarity criterion [PDF]
, 2012 Motivated by his studies in knot theory V. Vassiliev introduced $X$-graphs as regular 4-valent graph with a structure of pairs of opposite edges at each vertex.
Friesen, Tyler
core
Veterinary Dermatology, Volume 35, Issue 6, Page 595-604, December 2024.Background – Mycobacterium cell wall fraction (MCWF) is derived from nonpathogenic Mycobacterium phlei and is used as an immunomodulatory compound in clinical practice, yet its mode‐of‐action requires further research. Objective – To evaluate the host response to MCWF in canine peripheral blood mononuclear cells (PBMCs) by using enzyme‐linked ...
Robert Ward +9 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