A spectral inverse problem concerns the reconstruction of parameters a parent graph from prescribed data subgraphs. Also referred to as P–NP Isomorphism Problem, Reconstruction or Exact Graph Matching, aim is seek sets determine uniquely. Other related problems, including Polynomial Problem (PRP), involve recovery invariants. The PRP seeks extract spectrum deck cards each showing vertex-deleted...

Using the most recent updated physics, calibrated solar models have been computed with the new thermonuclear reaction rates of NACRE, the recently available European compilation. Comparisons with models computed with the reaction rates of Caughlan & Fowler (1988) and of Adelberger et al. (1998) are made for global structure, expected neutrinos fluxes, chemical composition and sound speed profil...

In [18], Farrell and Whitehead investigate circulant graphs that are uniquely characterized by their matching and chromatic polynomials (i.e., graphs that are “matching unique” and “chromatic unique”). They develop a partial classification theorem, by finding all matching unique and chromatic unique circulants on n vertices, for each n ≤ 8. In this paper, we explore circulant graphs that are un...