Results 111 to 120 of about 2,644,664 (312)
The ramsey number for theta graph versus a clique of order three and four
Discussiones Mathematicae Graph Theory, 2014 For any two graphs F1 and F2, the graph Ramsey number r(F1, F2) is the smallest positive integer N with the property that every graph on at least N vertices contains F1 or its complement contains F2 as a subgraph.
Bataineh M.S.A. +2 more
doaj +1 more source
On independent [1,2]-sets in trees
Discussiones Mathematicae Graph Theory, 2018 An independent $[1,k]$-set $S$ in a graph $G$ is a dominating set which is independent and such that every vertex not in $S$ has at most $k$ neighbors in it. The existence of such sets is not guaranteed in every graph and trees having an independent $[1,k]$-set have been characterized.
Sahar A. Aleid +2 more
openaire +4 more sources
FEBS Letters, EarlyView.Structural and biochemical characterisations show that the planar cell polarity (PCP) protein Inturned harbours a unique PDZ‐like domain that does not bind canonical PDZ‐binding motifs (PBMs) like that of another PCP protein Vangl2. In contrast, the apical‐basal polarity protein Scribble contains four PDZ domains that bind Vangl2, but one PDZ domain ...
Stephan Wilmes +4 more
wiley +1 more source
Calpain small subunit homodimerization is robust and calcium‐independent
FEBS Letters, EarlyView.Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy +4 more
wiley +1 more source
Bounds on the Clique and the Independence Number for Certain Classes of Graphs
MathematicsIn this paper, we study the class of graphs Gm,n that have the same degree sequence as two disjoint cliques Km and Kn, as well as the class G¯m,n of the complements of such graphs.
Valentin E. Brimkov, Reneta P. Barneva
doaj +1 more source
The complexity of combinatorial optimization problems on d‐dimensional boxes [PDF]
, 2007 The Maximum Independent Set problem in d-box graphs, i.e., in intersection graphs of axis-parallel rectangles in R-d, is known to be NP-hard for any fixed d >= 2.
Chlebikova, Janka +5 more
core +1 more source
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
FEBS Letters, EarlyView.A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source
Simplicial complexes defined on groups
Open MathematicsThis study makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group, which are preserved by automorphisms of the group, and in many
Cameron Peter J.
doaj +1 more source
Independent sets and repeated degrees
Discrete Mathematics, 1997 \textit{P. Erdös}, \textit{S. Fajtlowicz} and \textit{W. Staton} [Discrete Math. 92, No. 1-3, 85-88 (1991; Zbl 0752.05028)] showed that every triangle-free graph of order \(n\) in which no degree is repeated more than twice is bipartite and thus has independence number at least \(n/2\). \textit{P. Erdös}, \textit{R. Faudree}, \textit{T. J.
Bollobás, B, Scott, A
openaire +3 more sources
Data statistics of training set and independent testing set.
, 2015 Data statistics of training set and independent testing set.
Tzong-Yi Lee (10134) +5 more
core +1 more source