Results 71 to 80 of about 44,462 (291)
On the total coloring of planar graphs.
Journal für die reine und angewandte Mathematik (Crelles Journal), 1989 By Behzad and Vizing's conjecture (1968), \(\kappa_ t(G)\leq \Delta (G)+2\), where \(\kappa_ t(G)\) is the total chromatic number and \(\Delta\) (G) - the maximal degree of a graph G. For planar graphs G it is proved here that \(\kappa_ t(G)\leq \Delta (G)+2\) if \(\Delta\) (G)\(\not\in \{6,7,8\}\), \(\kappa_ t(G)\leq \Delta (G)+3\) always, and ...
openaire +2 more sources
Degradation mechanism of the von Willebrand factor A2 domain by nattokinase
FEBS Letters, EarlyView.Nattokinase, a natto‐derived protease, exhibits potent antithrombotic effects. This study demonstrates that nattokinase directly cleaves the von Willebrand factor (vWF) A2 domain in vitro. Unlike the native regulator ADAMTS13, nattokinase degrades folded vWF independently of shear stress.
Ryuichi Hyakumoto +3 more
wiley +1 more source
Vertex-Distinguishing IE-Total Colorings of Complete Bipartite Graphs Km,N(m < n)
Discussiones Mathematicae Graph Theory, 2013 Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C(u) be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring
Chen Xiang’en, Gao Yuping, Yao Bing
doaj +1 more source
An Improved Upper Bound on Neighbor Expanded Sum Distinguishing Index
Discussiones Mathematicae Graph Theory, 2020 A total k-weighting f of a graph G is an assignment of integers from the set {1, . . . , k} to the vertices and edges of G. We say that f is neighbor expanded sum distinguishing, or NESD for short, if Σw∈N(v) (f(vw) + f(w)) differs from Σw∈N(u)(f(uw) + f(
Vučković Bojan
doaj +1 more source
On total colorings of 1-planar graphs [PDF]
Journal of Combinatorial Optimization, 2013 A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we confirm the total-coloring conjecture for 1-planar graphs with maximum degree at least 13.
Xin Zhang 0017 +2 more
openaire +2 more sources
Modulation of Homer1 EVH1 domain internal dynamics by putative autism‐associated mutations
FEBS Letters, EarlyView.The putative autism‐associated M65I and S97L variants of the EVH1 domain of the postsynaptic scaffold protein Homer1 do not exhibit substantial changes in their overall structure or partner binding. Both of them, but especially the M65I variant, show altered internal dynamics relative to the wild‐type domain on the μs‐ms timescale, indicated by the ...
Fanni Farkas +6 more
wiley +1 more source
On harmonious chromatic number of triple star graph [PDF]
Journal of Hyperstructures, 2016 A Harmonious coloring of a graph G is a proper vertex coloring of G, in which every pair of colors appears on at most one pair of adjacent vertices and the harmonious chromatic number of graph G is the minimum number of colors needed for the harmonious ...
Akhlak Mansuri
doaj +1 more source
Edge colorings and total colorings of integer distance graphs
Discussiones Mathematicae Graph Theory, 2002 An integer distance graph is a graph \(G(D)\) with vertex set the set \(\mathbb{Z}\) of integers and two vertices \(u,v\in \mathbb{Z}\) adjacent if and only if \(|u-v|\in D\), where the distance set \(D\) is a subset of the set of positive integers \(\mathbb{N}\).
Arnfried Kemnitz, Massimiliano Marangio
openaire +2 more sources
FEBS Letters, EarlyView.The physical dimensions and shape of bacterial cells define the surface area available to acquire nutrients and the volume available for synthesizing proteins and DNA. Here, we use computational systems biology to decode the importance of cell geometry as a major determinant of prokaryotic phenotype, including growth rate and metabolic efficiency. This
Ross P. Carlson +6 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