-
Article
Open AccessDevelopment of New CD38 Targeted Peptides for Cancer Imaging
Multiple myeloma (MM) affects over 35,000 patients each year in the US. There remains a need for versatile Positron Emission Tomography (PET) tracers for the detection, accurate staging, and monitoring of trea...
-
Article
Coloring of Some Crown-Free Graphs
Let G and H be two vertex disjoint graphs. The union \(G\cup H\) G ...
-
Article
A Tight Linear Bound to the Chromatic Number of \((P_5, K_1+(K_1\cup K_3))\) -Free Graphs
Let \(F_1\) F 1
-
Article
Partitions of Multigraphs Without \(C_4\)
Let G be a graph that may have multiedges, let \(\mu (u, v)\) μ ( ...
-
Article
Ultrabright fluorescent nanoscale labels for the femtomolar detection of analytes with standard bioassays
The detection and quantification of low-abundance molecular biomarkers in biological samples is challenging. Here, we show that a plasmonic nanoscale construct serving as an ‘add-on’ label for a broad range of...
-
Article
Selective imaging of solid tumours via the calcium-dependent high-affinity binding of a cyclic octapeptide to phosphorylated Annexin A2
The heterogeneity and continuous genetic adaptation of tumours complicate their detection and treatment via the targeting of genetic mutations. However, hallmarks of cancer such as aberrant protein phosphoryla...
-
Article
Open AccessDural lymphatics regulate clearance of extracellular tau from the CNS
Alzheimer’s disease is characterized by two main neuropathological hallmarks: extracellular plaques of amyloid-β (Aβ) protein and intracellular aggregates of tau protein. Although tau is normally a soluble mon...
-
Article
2-Distance coloring of planar graphs with girth 5
A vertex coloring is said to be 2-distance if any two distinct vertices of distance at most 2 receive different colors. Let G be a planar graph with girth at least 5. In this paper, we prove that G admits a 2-dis...
-
Article
Chromatic number and subtrees of graphs
Let G and H be two graphs. We say that G induces H if G has an induced subgraph isomorphic to H: A. Gyárfás and D. Sumner, independently, conjectured that, for every tree T. there exists a function f ...
-
Article
On judicious partitions of graphs
Let \(k, m\) k , ...
-
Article
Utilizing the Multiradionuclide Resolving Power of SPECT and Dual Radiolabeled Single Molecules to Assess Treatment Response of Tumors
Single photon emission computed tomography (SPECT) radionuclide pairs having distinct decay rates and different energy maxima enable simultaneous detection of dual gamma signals and real-time assessment of dyn...
-
Article
Bipartition of graph under degree constraints
Let G be a graph, let s be a positive integer, and let X be a subset of V (G). Denote δ(X) to be the minimum degree of the subgraph G[X] induced by X. A partition (X, Y) of V (G) is called s-good if min{δ(X), δ(Y
-
Article
An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance
We consider the design of semidefinite programming (SDP) based approximation algorithm for the problem Max Hypergraph Cut with Limited Unbalance (MHC-LU): Find a partition of the vertices of a weighted hypergraph...
-
Article
On minimum balanced bipartitions of triangle-free graphs
A balanced bipartition of a graph G is a partition of V(G) into two subsets V 1 and V 2 that differ in cardinality by at most 1. A minimum balanced bipartition of G is a balanced b...
-
Article
Acyclic edge coloring of planar graphs without adjacent cycles
A proper edge coloring of a graph G is said to be acyclic if there is no bicolored cycle in G. The acyclic edge chromatic number of G, denoted byχ′ a (G), is the smallest number ...
-
Article
Open AccessDual fluorescent molecular substrates selectively report the activation, sustainability and reversibility of cellular PKB/Akt activity
Using a newly developed near-infrared (NIR) dye that fluoresces at two different wavelengths (dichromic fluorescence, DCF), we discovered a new fluorescent substrate for Akt, also known as protein kinase B and...
-
Article
Maximum Directed Cuts in Graphs with Degree Constraints
The Max Cut problem is an NP-hard problem and has been studied extensively. Alon et al. (J Graph Theory 55:1–13, 2007) studied a directed version of the Max Cut problem and observed its connection to the Hall rat...
-
Article
Improved bounds on linear coloring of plane graphs
A proper vertex coloring of a graph G is linear if the graph induced by the vertices of any two color classes is the union of vertex-disjoint paths. The linear chromatic number lc(G) of the graph G is the smalles...
-
Article
On a bipartition problem of Bollobás and Scott
The bipartite density of a graph G is max {|E(H)|/|E(G)|: H is a bipartite subgraph of G}. It is NP-hard to determine the bipartite density of any triangle-free cubic graph. A biased maximum bipartite subgraph of...
-
Article
Relay sensor placement in wireless sensor networks
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum number of relay sensors such tha...
