Sufficient Conditions for a Digraph to be Supereulerian

A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs.     

Condensation of Diamantan-3-one with Malononitrile and Methyl and Ethyl Cyanoacetates in the Presence of Binder-Free FeHY and NiHy Zeolites

Russian Journal of Organic Chemistry - Binder-free iron- and nickel-containing micro-, meso-, and macroporous zeolites FeHY and NiHY were found to effectively catalyze Knoevenagel condensation of...     

Thermal,morphostructural and spectrometric characterization of an antibacterial kaolinite-based filter modified with silver for water treatment

Journal of Thermal Analysis and Calorimetry - The aim of this work is to synthesize and characterize a new structured silver–clay dried, calcined or sintered at different temperatures...     

Solid Echo in Three-Spin Groups with Arbitrary Constants of Dipole–Dipole Interaction

Applied Magnetic Resonance - The suggested approach allowed us to derive analytical expressions for modeling the shape of solid-echo signal and its time evolution for a system of three-spin groups...