Development of a fluoride-responsive amide bond cleavage device that is potentially applicable to a traceable linker

A fluoride-responsive (FR) amino acid that induces amide bond cleavage upon the addition of a fluoride was developed, and it was applied to an FR traceable linker. By the use of an alkyne-containing peptide as a model of an alkynylated target protein of a bioactive compound, introduction of the FR traceable linker onto the peptide was achieved. Subsequent fluoride-induced cleavage of the linker followed by labeling of the released peptide derivative was also conducted to examine the potential applicability of the FR traceable linker to the enrichment and labeling of alkynylated target molecules.     

Sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles

We construct multigraphs of any large order with as few as only four 2-decompositions into Hamilton cycles or only two 2-decompositions into Hamilton paths. Nevertheless, some of those multigraphs are proved to have exponentially many Hamilton cycles (Hamilton paths). Two families of large simple graphs are constructed. Members in one class have exactly 16 hamiltonian pairs and in another class exactly four traceable pairs. These graphs also have exponentially many Hamilton cycles and Hamilton paths, respectively. The exact numbers of (Hamilton) cycles and paths are expressed in terms of Lucas- or Fibonacci-like numbers which count 2-independent vertex (or edge) subsets on the n-path or n-cycle. A closed formula which counts Hamilton cycles in the square of the n-cycle is found for n≥5. The presented results complement, improve on, or extend the corresponding well-known Thomason’s results.     

Neighborhood unions and extremal spanning trees

We generalize a known sufficient condition for the traceability of a graph to a condition for the existence of a spanning tree with a bounded number of leaves. Both of the conditions involve neighborhood unions. Further, we present two results on spanning spiders (trees with a single branching vertex). We pose a number of open questions concerning extremal spanning trees.     

Domination game and minimal edge cuts

In this paper a relationship is established between the domination game and minimal edge cuts. It is proved that the game domination number of a connected graph can be bounded above in terms of the size of minimal edge cuts. In particular, if $C$ a minimum edge cut of a connected graph $G$, then ${\gamma }_g\left(G\right)\le {\gamma }_g(G?C)+2{\kappa }^{\prime }\left(G\right)$. Double-Staller graphs are introduced in order to show that this upper bound can be attained for graphs with a bridge. The obtained results are used to extend the family of known traceable graphs whose game domination numbers are at most one-half their order. Along the way two technical lemmas, which seem to be generally applicable for the study of the domination game, are proved.     

Spectral results on Hamiltonian problem

Let $\alpha$ be a non-negative real number, and let $\Theta (G,\alpha )$ be the largest eigenvalue of $A\left(G\right)+\alpha D\left(G\right)$. Specially, $\Theta (G,0)$ and $\Theta (G,1)$ are called the spectral radius and signless Laplacian spectral radius of $G$, respectively. A graph $G$ is said to be Hamiltonian (traceable) if it contains a Hamiltonian cycle (path), and a graph $G$ is called Hamilton-connected if any two vertices are connected by a Hamiltonian path in $G$. The number of edges of $G$ is denoted by $e\left(G\right)$. Recently, the (signless Laplacian) spectral property of Hamiltonian (traceable, Hamilton-connected) graphs received much attention. In this paper, we shall give a general result for all these existed results. To do this, we first generalize the concept of Hamiltonian, traceable, and Hamilton-connected to $s$-suitable, and we secondly present a lower bound for $e\left(G\right)$ to confirm the existence of $s$-suitable graphs. Thirdly, when $0\le \alpha \le 1$, we obtain a lower bound for $\Theta (G,\alpha )$ to confirm the existence of $s$-suitable graphs. Consequently, our results generalize and improve all these existed results in this field, including the main results of Chen et al. (2018), Feng et al. (2017), Füredi et al. (2017), Ge et al. (2016), Li et al. (2016), Nikiforov et al. (2016), Wei et al. (2019) and Yu et al. (2013, 2014).     

An Ore-type condition for arbitrarily vertex decomposable graphs

Let G be a graph of order n and r, 1≤r≤n, a fixed integer. G is said to be r-vertex decomposable if for each sequence (n₁,…,n_r) of positive integers such that n₁+?+n_r=n there exists a partition (V₁,…,V_r) of the vertex set of G such that for each i∈{1,…,r}, V_i induces a connected subgraph of G on n_i vertices. G is called arbitrarily vertex decomposable if it is r-vertex decomposable for each r∈{1,…,n}.In this paper we show that if G is a connected graph on n vertices with the independence number at most ⌈n/2⌉ and such that the degree sum of any pair of non-adjacent vertices is at least n−3, then G is arbitrarily vertex decomposable or isomorphic to one of two exceptional graphs. We also exhibit the integers r for which the graphs verifying the above degree-sum condition are not r-vertex decomposable.     

Hamiltonian properties of polyhedra with few 3-cuts—A survey

We give an overview of the most important techniques and results concerning the hamiltonian properties of planar 3-connected graphs with few 3-vertex-cuts. In this context, we also discuss planar triangulations and their decomposition trees. We observe an astonishing similarity between the hamiltonian behavior of planar triangulations and planar 3-connected graphs. In addition to surveying, (i) we give a unified approach to constructing non-traceable, non-hamiltonian, and non-hamiltonian-connected triangulations, and show that planar 3-connected graphs (ii) with at most one 3-vertex-cut are hamiltonian-connected, and (iii) with at most two 3-vertex-cuts are 1-hamiltonian, filling two gaps in the literature. Finally, we discuss open problems and conjectures.