Results 21 to 30 of about 107 (89)
A Note on the Upper Bounds on the Size of Bipartite and Tripartite 1-Embeddable Graphs on Surfaces
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
Characteristic polynomials of some weighted graph bundles and its application to links
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
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
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
The Crossing Numbers of Join of Some Graphs with n Isolated Vertices
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
Facial [r,s,t]-Colorings of Plane Graphs
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
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
A subexponential construction of graph coloring for multiparty computation
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
Non-1-Planarity of Lexicographic Products of Graphs
In this paper, we show the non-1-planarity of the lexicographic product of a theta graph and K2. This result completes the proof of the conjecture that a graph G ◦ K2 is 1-planar if and only if G has no edge belonging to two cycles.
Matsumoto Naoki, Suzuki Yusuke
doaj +1 more source
Background – Canine atopic dermatitis (cAD) is a chronic, inflammatory, multifactorial and pruritic disease. The presence of skin barrier impairment (e.g. filaggrin alterations), along with abnormal immune responses, can negatively impact cutaneous barrier function.
Wendie Roldan Villalobos +5 more
wiley +1 more source

