The polynomial reconstruction problem: The first 50 years

The problem of reconstructing the characteristic polynomial of a graph of order at least 3 from the collection of characteristic polynomials of its vertex-deleted subgraphs was posed by Cvetkovi? in 1973 as a spectral counter part to the well-known Ulam's reconstruction conjecture. Over the last 50 years, this problem has received notable attention, many positive results have been obtained, but in the general case the problem is still unresolved. In particular, no counter example is found in literature. In this expository paper we survey classical and some more recent results concerning the polynomial reconstruction problem, discuss some related problems, variations and generalizations.     

Highly edge-connected factors using given lists on degrees

Let G be a 2k-edge-connected graph with and let for every . A spanning subgraph F of G is called an L-factor, if for every . In this article, we show that if for every , then G has a k-edge-connected L-factor. We also show that if and for every , then G has a k-edge-connected L-factor.     

On the hyperbolic order

We define the hyperbolic order of any locally injective holomorphic function between arbitrary hyperbolic domains of the complex plane and study the relation between the hyperbolic order and the Schwarzian derivative for locally injective holomorphic functions from the unit disk into itself.     

Search of truncation of (N−1) electron basis containing full connected triple excitations in computing main and satellite ionization potentials via Fock‐space coupled cluster approach

A valence‐universal multireference coupled cluster (VUMRCC) theory, realized via the eigenvalue independent partitioning (EIP) route, has been implemented with full inclusion of triples excitations for computing and analyzing the entire main and several satellite peaks in the ionization potential spectra of several molecules. The EIP‐VUMRCC method, unlike the traditional VUMRCC theory, allows divergence‐free homing‐in to satellite roots which would otherwise have been plagued by intruders, and is thus numerically more robust to obtain more efficient and dependable computational schemes allowing more extensive use of the approach. The computed ionization potentials (IPs) as a result of truncation of the (N−1) electron basis manifold involving virtual functions such as 2h‐p and 3h‐2p by different energy thresholds varying from 5 to 15 a.u. with 1 a.u. intervals as well as thresholds such as 20, 25, and 30 a.u. have been carefully looked into. Cutoff at around 25 a.u. turns out to be an optimal threshold. Molecules such as C₂H₄ and C₂H₂ (X = D,T), and N₂ and CO (X = D,T,Q) with Dunning's cc‐pVXZ bases have been investigated to determine all main and 2h‐p shake‐up and 3h‐2p double shake‐up satellite IPs. We believe that the present work will pave the way to a wider application of the method by providing main and satellite IPs for some problematic N‐electron closed shell systems. © 2013 Wiley Periodicals, Inc.     

最大边连通和super-边连通超图的充分条件

设H是连通超图。若超图H的边连通度等于其最小度,则称H是最大边连通的。若超图H的每个最小边割总是由关联于某个最小度顶点的边集所构成,则称H是super-边连通的。首先给出一致线性超图是最大边连通超图的度序列条件。其次,给出一致线性超图是super-边连通超图的度条件。这些结果分别推广了Dankelmann和Volkmann（1997）以及Hellwig和Volkmann（2005）在图上的相关结论。     

Connected Domatic Number in Planar Graphs

A dominating set in a graph G is a connected dominating set of G if it induces a connected subgraph of G. The connected domatic number of G is the maximum number of pairwise disjoint, connected dominating sets in V(G). We establish a sharp lower bound on the number of edges in a connected graph with a given order and given connected domatic number. We also show that a planar graph has connected domatic number at most 4 and give a characterization of planar graphs having connected domatic number 3.     

包含k-树图的毁裂度条件

连通图G的一个k-树是指图G的一个最大度至多是k的生成树.对于连通图G来说,其毁裂度定义为r(G)=max{ω(G-X)-|X|-m(G-X)|X■V(G),ω(G-X)1}其中ω(G-X)和m(G-X)分别表示G-X中的分支数目和最大分支的阶数.本文结合毁裂度给出连通图G包含一个k-树的充分条件;利用图的结构性质和毁裂度的关系逐步刻画并给出图G包含一个k-树的毁裂度条件.