Results 131 to 140 of about 302,460 (378)
Chemistry – An Asian Journal, Volume 20, Issue 6, March 17, 2025.In CH2X2 (X=Cl, Br, and I) molecules, the magnitude of σ‐hole on the X atom decreases from CH2I2 to CH2Cl2 . Three different types of interactions i. e., C−X⋅⋅⋅O halogen bond, and C−H⋅⋅⋅O and O−H⋅⋅⋅X hydrogen bond, are possible in [CH3OH−CH2X2] complexes.
Sumit Kumar Agrawal +2 more
wiley +1 more source
Asian Journal of Control, EarlyView.Abstract This article addresses the cooperative output consensus tracking problem for high‐order heterogeneous multi‐agent systems via a distributed proportional‐integral‐derivative (PID)‐like control strategy and proposes two novel control methodologies for the tuning of the control gains, which do not require any assumption and/or limitation on agent
Dario Giuseppe Lui +2 more
wiley +1 more source
Asian Journal of Control, EarlyView.Abstract This paper focuses on the issue of adaptive event‐triggered containment control for Markov jump multi‐agent systems characterized by hidden Markov jump parameters. The central objective is to design an output‐feedback controller for the Markov jump multi‐agent system by using an adaptive event‐triggered technique that not only ensures the ...
Parivallal Arumugam +3 more
wiley +1 more source
CrysToGraph: A Comprehensive Predictive Model for Crystal Material Properties and the Benchmark
Battery Energy, EarlyView.We propose CrysToGraph (Crystals with Transformers on Graph), a transformer‐based geometric graph network, to explicitly capture both short‐range and long‐range interactions in crystals, and UnconvBench, a benchmark to evaluate models' predictive performance on multiple categories of materials. This work enhances the development of crystal materials in
Hongyi Wang +9 more
wiley +1 more source
A conjecture on square roots of Laplacian and signless Laplacian eigenvalues of graphs [PDF]
arXiv, 2009 We conjecture that the sum of the square roots of the Laplacian eigenvalues of a graph does not exceed the sum of the square roots of its signless Laplacian eigenvalues.
arxiv
ChemistryEurope, EarlyView.GA: Ligand precursor 2‐(2‐pyridin‐2‐ylmethylamino)acetic acid (HL1) featuring flexible alkyl chains formed PtII and PtIV complexes with coordination involving the COO‐ group. In contrast, 4‐(2‐pyridin‐2‐ylmethylamino)benzoic acid (HL2) with a rigid p‐phenylene moiety successfully formed the desired PtII and PtIV complexes featuring free carboxylic acid
Stefan Richter +4 more
wiley +1 more source
Laplacian and signless Laplacian spectral radii of graphs with fixed domination number [PDF]
arXiv, 2013 In this paper, we determine the maximal Laplacian and signless Laplacian spectral radii for graphs with fixed number of vertices and domination number, and characterize the extremal graphs respectively.
arxiv
Reduction of CO2 and Related Compounds with a Low‐Valent CaI Synthon
ChemistryEurope, EarlyView.The reduction of CO2, CS2, or carbodiimide with a CaI synthon results in formation of calcium complexes with CO32−, CS22− or C–C coupled carbodiimide dianions. Differences between reduction of these reagents with the CaI synthon and established MgI complexes are discussed. Combined experimental and computational investigations give insight in the first
Stefan Thum +4 more
wiley +1 more source
International Journal of Robust and Nonlinear Control, EarlyView., 2023 Abstract We propose a hierarchical energy management scheme for aggregating Distributed Energy Resources (DERs) for grid flexibility services. To prevent a direct participation of numerous prosumers in the wholesale electricity market, aggregators, as self‐interest agents in our scheme, incentivize prosumers to provide flexibility. We firstly model the
Xiupeng Chen +3 more
wiley +1 more source
Maxima of the signless Laplacian spectral radius for planar graphs [PDF]
arXiv, 2014 The signless Laplacian spectral radius of a graph is the largest eigenvalue of its signless Laplacian. In this paper, we prove that the graph $K_{2}\nabla P_{n-2}$ has the maximal signless Laplacian spectral radius among all planar graphs of order $n\geq 456$.
arxiv