Results 91 to 100 of about 20,650,729 (303)
Lower bounds of graph energy in terms of matching number
Linear Algebra and its Applications, 2018 The energy E ( G ) of a graph G is the sum of the absolute values of all eigenvalues of G . We are interested in the relation between the energy of a graph G and the matching number μ ( G ) of G . It is proved that E ( G ) ≥ 2 μ ( G ) for every graph G ,
Dein Wong, Xinlei Wang, Rui Chu
semanticscholar +1 more source
Ramsey Number of a Connected Triangle Matching [PDF]
Journal of Graph Theory, 2015 AbstractWe determine the 2‐color Ramsey number of a connected triangle matching that is any connected graph containing n vertex disjoint triangles. We obtain that , somewhat larger than in the classical result of Burr, Erdős, and Spencer for a triangle matching, . The motivation is to determine the Ramsey number of the square of a cycle .
Sárközy, Gábor, Gyárfás, András
openaire +5 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
MathematicsConsider a unicyclic graph G with edge set E(G). Let f be a real-valued symmetric function defined on the Cartesian square of the set of all distinct elements of G’s degree sequence. A graphical edge-weight-function index of G is defined as If(G)=∑xy∈E(G)
Akbar Ali +3 more
doaj +1 more source
Tight lower bounds on the matching number in a graph with given maximum degree [PDF]
Journal of Graph Theory, 2016 Let k≥3 . We prove the following three bounds for the matching number, α′(G) , of a graph, G, of order n size m and maximum degree at most k. If k is odd, then α′(G)≥(k−1k(k2−3))n+(k2−k−2k(k2−3))m−k−1k(k2−3) .
M. Henning, Anders Yeo
semanticscholar +1 more source
The number of perfect matchings in a brick
Discrete MathematicsA 3-connected graph is a brick if the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that they are building blocks of the matching decomposition procedure of Kotzig, and Lovasz and Plummer.
Fuliang Lu, Huali Pan
openaire +3 more sources
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
Arithmetic mismatch negativity and numerical magnitude processing in number matching
BMC Neuroscience, 2011 Background This study examined the relationship of the arithmetic mismatch negativity (AMN) and the semantic evaluation of numerical magnitude. The first question was whether the AMN was sensitive to the incongruity in numerical information per se, or ...
Szücs Dénes, Hsu Yi-Fang
doaj +1 more source
Structural insights and therapeutic targets in Acinetobacter baumannii capsule biosynthesis
FEBS Letters, EarlyView.Hypervirulent KL49 A. baumannii's capsular polysaccharide contains the nonulosonic acid 8‐epi‐Leg5,7Ac2, synthesized by epimerization via ElaA, ElaB, and ElaC. Crystal structures of ElaA, ElaB, and ElaC reveal their role in CMP‐Leg5,7Ac2 synthesis and regioselective C8 epimerization.
Woo Cheol Lee +7 more
wiley +1 more source
Diversified Top-k Graph Pattern Matching [PDF]
, 2013 Graph pattern matching has been widely used in e.g., social data analysis. A number of matching algorithms have been developed that, given a graph pattern Q and a graph G, compute the set M(Q;G) of matches of Q in G.
Wang, Xin +2 more
core