English
Related papers

Related papers: Simple Alcohols with the Lowest Normal Boiling Poi…

200 papers

We perform an extensive computational study of binary mixtures of water and short-chain alcohols resorting to two-scale potential models to account for the singularities of hydrogen bonded liquids. Water molecules are represented by a well…

Soft Condensed Matter · Physics 2017-04-26 A. P. Furlan , E. Lomba , M. C. Barbosa

The automatic analysis of chemical literature has immense potential to accelerate the discovery of new materials and drugs. Much of the critical information in patent documents and scientific articles is contained in figures, depicting the…

Computer Vision and Pattern Recognition · Computer Science 2024-08-29 Lucas Morin , Martin Danelljan , Maria Isabel Agea , Ahmed Nassar , Valery Weber , Ingmar Meijer , Peter Staar , Fisher Yu

The Wiener index is defined as the sum of distances between all unordered pairs of vertices in a graph. It is one of the most recognized and well-researched topological indices, which is on the other hand still a very active area of…

Combinatorics · Mathematics 2023-03-22 Martin Knor , Riste Škrekovski , Aleksandra Tepeh

We consider the configuration model and the uniform simple graph with given degree sequence $\boldsymbol{d}=\left(d_i\right)_{i=1}^n$. We derive quantitative bounds for the errors in (i) joint normal-Poisson approximation to the numbers of…

Probability · Mathematics 2026-05-29 Ryo Imai

A Weyl point in a superconducting nanostructure is a generic minimum model of a topological singularity at low energies. We connect the nanostructure to normal leads thereby immersing the topological singularity in the continuous spectrum…

Mesoscale and Nanoscale Physics · Physics 2021-09-22 Y. Chen , Y. V. Nazarov

Let $\mathcal {T}^{\Delta}_n$ denote the set of trees of order $n$, in which the degree of each vertex is bounded by some integer $\Delta$. Suppose that every tree in $\mathcal {T}^{\Delta}_n$ is equally likely. For any given subtree $H$,…

Combinatorics · Mathematics 2010-05-10 Xueliang LI , Yiyang Li

For a simple graph, we introduce a notion of the star sequence and prove that the star sequence and the frequently sequences of a graph are inverses of each other from a combinatorial point of view. As a consequence, we express the general…

Combinatorics · Mathematics 2018-09-19 Leonid Bedratyuk , Oleg Savenko

Asymptotic separation index is a parameter that measures how easily a Borel graph can be approximated by its subgraphs with finite components. In contrast to the more classical notion of hyperfiniteness, asymptotic separation index is…

Logic · Mathematics 2025-03-10 Anton Bernshteyn , Felix Weilacher

The atoms of the Schanuel topos can be described as the pairs $(n,G)$ where $n$ is a finite set and $G$ is a subgroup of $\operatorname{Aut}(n)$. We give a general criterion on an atomic site ensuring that the atoms of the topos of sheaves…

Category Theory · Mathematics 2025-05-27 Jérémie Marquès

The hydrogen-bonded structure of methanol-water mixtures is investigated over the entire alcohol concentration range (from $x_{\mathrm{Methanol}}=$ 0.1 to 1.0) at several temperatures, from 300 K down to the freezing point of the given…

Chemical Physics · Physics 2023-07-07 Ildikó Pethes , László Pusztai , László Temleitner

We consider chemical graphs that are defined as connected graphs of maximum degree at most 3. We characterize the extremal graphs, meaning those that maximize or minimize 33 degree-based topological indices. This study shows that five graph…

Combinatorics · Mathematics 2025-01-07 Sébastien Bonte , Gauvain Devillez , Valentin Dusollier , Alain Hertz , Hadrien Mélot

The first multiplicative Zagreb index $\Pi_1$ of a graph $G$ is the product of the square of every vertex degree, while the second multiplicative Zagreb index $\Pi_2$ is the product of the products of degrees of pairs of adjacent vertices.…

Combinatorics · Mathematics 2019-07-01 Fazal Hayat

In the study of topological indices two negative correlations are well known: that between the number of subtrees and the Wiener index (sum of distances), and that between the Merrifield-Simmons index (number of independent vertex subsets)…

Combinatorics · Mathematics 2020-01-23 Eric Ould Dadah Andriantiana , Hua Wang

We develop intuitive metrics for quantifying complex nucleating systems under confinement. These are shown to arise naturally from the analysis of the topological ring network, and are amenable for use as order parameters for such systems.…

Chemical Physics · Physics 2020-04-22 Amrita Goswami , Jayant K. Singh

The eccentric connectivity index of a connected graph $G$ is the sum over all vertices $v$ of the product $d_{G}(v) e_{G}(v)$, where $d_{G}(v)$ is the degree of $v$ in $G$ and $e_{G}(v)$ is the maximum distance between $v$ and any other…

Discrete Mathematics · Computer Science 2024-03-11 Gauvain Devillez , Alain Hertz , Hadrien Mélot , Pierre Hauweele

The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least 2 and $S\subseteq V(G)$, the Steiner distance…

The second Zagreb index of a graph G is denoted by $M_2(G)=\sum_{uv\in E(G)}d(u)d(v)$. In this paper, we investigate properties of the extremal graphs with the maximum second Zagreb indices with given graphic sequences, in particular…

Combinatorics · Mathematics 2015-03-30 Wei-Gang Yuan , Xiao-Dong Zhang

A new method for solving small X-ray structures with up to couple of hundreds of atoms in the unit cell has been developed. The method works by locating atoms one-by-one via global minimization of a newly defined single-atom R1 factor in…

Data Analysis, Statistics and Probability · Physics 2024-03-21 Xiaodong Zhang

Carbon, as one of the most common element in the earth, constructs hundreds of allotropic phases to present rich physical nature. In this work, by combining the ab inito calculations and symmetry analyses method, we systematically study a…

Materials Science · Physics 2023-08-21 Qing-Bo Liu , Xiang-Feng Yang , Zhe-Qi Wang , Ziyang Yu , Lun Xiong , Hua-Hua Fu

When considering a graph problem from a parameterized point of view, the parameter chosen is often the size of an optimal solution of this problem (the "standard" parameter). A natural subject for investigation is what happens when we…

Computational Complexity · Computer Science 2013-10-14 Nicolas Bourgeois , Konrad K. Dabrowski , Marc Demange , Vangelis Th. Paschos