a set $s$ of vertices in a graph $g$ is a dominating set if every vertex of $v-s$ is adjacent to some vertex in $s$. the domination number $gamma(g)$ is the minimum cardinality of a dominating set in $g$. the annihilation number $a(g)$ is the largest integer $k$ such that the sum of the first $k$ terms of the non-decreasing degree sequence of $g$ is at most the number of edges in $g$. in this p...

A number of approaches are proposed and assessed to reduce the frozen natural orbital (FNO) truncation error coupled-cluster singles doubles with perturbative triples [CCSD(T)] energies. The diagrammatic energy decomposition method Irmler Grüneis [J. Chem. Phys. 151, 104107 (2019)] is extended FNO correction particle-particle ladder (PPL) term in case closed- open-shell molecular systems. appro...