Joining Forces for Reconstruction Inverse Problems

: A spectral inverse problem concerns the reconstruction of parameters of a parent graph from prescribed spectral data of subgraphs. Also referred to as the P–NP Isomorphism Problem, Reconstruction or Exact Graph Matching , the aim is to seek sets of parameters to determine a graph uniquely. Other related inverse problems, including the Polynomial Reconstruction Problem (PRP), involve the recovery of graph invariants. The PRP seeks to extract the spectrum of a graph from the deck of cards each showing the spectrum of a vertex-deleted subgraph. We show how various algebraic methods join forces to reconstruct a graph or its invariants from a minimal set of restricted eigenvalue-eigenvector information of the parent graph or its subgraphs. We show how functions of the entries of eigenvectors of the adjacency matrix A of a graph can be retrieved from the spectrum of eigenvalues of A . We establish that there are two subclasses of disconnected graphs with each card of the deck showing a common eigenvalue. These could occur as possible counter examples to the positive solution of the PRP.


Introduction
An undirected graph G has a vertex set V (G) = {1, 2, . . ., n} of n vertices and an edge set E joining pairs of the vertices.The graphs we consider are simple, that is, they are without loops or multiple edges.By convention, its adjacency matrix A is such that the (i, j) entry is 1 if (i, j) ∈ E, and 0 otherwise.For all i, let µ i be the ith largest eigenvalue of A, with multiplicity η i .The entries on the diagonal of A are 0.
The eigenvalues of G are the eigenvalues of A; λ i is an eigenvalue of A if Ax = λ i x, for some x = 0.The characteristic polynomial of A is denoted by φ(G, λ) and As A is real and symmetric, the eigenvalues λ 1 , λ 2 , . . ., λ n of G are real and are said to form the spectrum, Sp(G), of G.The eigenspace E i associated with an eigenvalue µ i is {x i ∈ R n : Ax i = µ i x i }.
In 1941, S. M. Ulam and P. J. Kelly were working on what has become known as Ulam's Reconstruction Conjecture (R.C.) [1][2][3][4].In 1964, Harary proposed the RC as follows: We are presented with a deck D of n ≥ 3 cards each showing a one-vertex-deleted unlabeled subgraph G − v for each v ∈ V (G).The problem is to recover the parent graph G from D.
Although the classical graph reconstruction problem, RC, has been around for a long time, this topic is significant in the context of modern problems such as those encountered in graph mining.
An algebraic variation of the R.C., first posed by D. M. Cvetković in 1973 and later considered by I. Gutman and D. M. Cvetković in [5], is the Polynomial Reconstruction Problem (PRP): Is it possible to recover the characteristic polynomial of a graph of order at least 3, from the p-deck , P D(H), of H, consisting of the characteristic polynomials of the one-vertexdeleted subgraphs (with multiplicities)?
The restriction on the order is necessary as the pair of graphs on two vertices form a counter example to both RC and PRP.Both have been solved for some classes of graphs but are still open in general.
Other studies on the PRP can be found in [6][7][8][9][10][11].If a p-deck determines that the parent graph belongs to a particular class C of graphs, then recognition is established.If furthermore, a p-deck provides sufficient information for the parent graph to be constructed, then reconstruction follows.If both stages are performed successfully, then the graphs in class C are said to be polynomial reconstructible and the PRP is said to be solved positively for C.
Another approach, mainly used regarding the PRP, is the counter example technique [7,12].A graph H is assumed not to be polynomial reconstructible and that there exists a counter example G. Thus, G has the same p-deck as H but a different spectrum.This approach rules out certain classes C of graphs.The existence of polynomial reconstruction would then be established for C without demonstrating the actual reconstruction.
W.T.Tutte combined the combinatorial and algebraic aspects.He showed that φ(G, λ) is reconstructible from D [13].To date only the two graphs K 2 and 2K 1 , on two vertices are known to have the same deck and the same p-deck.If there were to be another pair of non-isomorphic graphs G 1 and G 2 , of higher order, with the same deck, then by Tutte's theorem on reconstruction [13], they would be cospectral.
In this article, there are two main aims.Combinatorial and algebraic properties of a parent graph and of its deck join forces to produce minimal collections of parameters that suffice to reconstruct the parent graph or its invariants.First, a graph invariant C i v equal to the sum of squares of the v entries of certain eigenvectors associated with an eigenvalue µ i is reconstructed.Second, the PRP for disconnected graphs is investigated.In particular, disconnected graphs {H} with a common eigenvalue deck lend themselves to interesting algebraic techniques for the recovery of the graph or certain graph invariants, enabling combinatorial characterizations.
In Section 2, we derive an expression for the characteristic polynomial of a vertexdeleted subgraph from the eigenspaces of the parent graph leading to new proofs of two well known theorems, namely Clarke's derivative of the characteristic polynomial and Cauchy's Inequalities for non-negative matrices (also referred to as the Interlacing Theorem).The techniques in the proofs are useful in the sequel.We then define the graph invariant, C i v , depending on v and the eigenspace E i .For simple eigenvalues, C i v yields the associated unit eigenvector entries up to sign.In Section 3, we focus on counter examples to the positive resolution of the PRP for the class of disconnected graphs {H} with a common eigenvalue deck, which is shown to be partitioned into two subclasses depending on whether H has the eigenvalue.We give a characterization of the graphs in the two classes.

The Characteristic Polynomial of a Vertex-Deleted Subgraph
In this section, we derive an expression for the characteristic polynomial of a vertexdeleted subgraph from the eigenspaces of the parent graph.The information this expression provides leads to new proofs of two well known theorems, namely, Clarke's derivative of the characteristic polynomial and Cauchy's Inequalities for non-negative matrices (also referred to as the Interlacing Theorem).These two theorems are among the most powerful in spectral graph theory.The notation and techniques used in the proofs of these two theorems has facilitated the new theory developed in the rest of the paper.We proceed to determine C i v , from the eigenvalues of the graph.These graph parameters provide eigenvector entries, up to sign, for one dimensional eigenspaces.Moreover, the non-zero values of C i v reveal the vertices v of the graph of type known as µ i -core vertex.
Theorem 1.Let an n-vertex graph G have the n eigenvalues λ 1 , λ 2 , . . ., λ n , written in nonincreasing order.Let {y i }, 1 ≤ i ≤ n, be an ordered orthonormal set of eigenvectors.If y r v is the vth entry of the eigenvector y r , then the characteristic polynomial Proof.The characteristic polynomial φ(G − v, λ) of G − v is the vth diagonal entry of the adjugate of λI − A, where A is the adjacency matrix of G.
Let Diag[α i ] denote the diagonal matrix with entries {α i } on the main diagonal and 0 on the off-diagonal entries.The orthogonal matrix P := (y 1 | y 2 | . . .| y n ) diagonalizes G such that P t (A)P = Diag[λ i ] and thus P t (λI − A) − As A is real symmetric, its eigenvalues are real.As shown in the proof of Theorem 1, the columns of an orthogonal diagonalizing matrix P are mutually orthonormal eigenvectors {y i }, 1 ≤ i ≤ n.Let the multiplicity of the distinct eigenvalues µ 1 , µ 2 , . . ., µ s of A(G) be η 1 , η 2 , . . ., η s .From P AP = Σ where Σ is a diagonal matrix with the eigenvalues of A on its diagonal, one can deduce the spectral decomposition A(G) = µ 1 P 1 + µ 2 P 2 + . . .+ µ s P s of A, where P i is the orthogonal projection of R n onto E i for 1 ≤ i ≤ n.
Using the notation in the proof of Theorem 1, let ) 2 be associated with vertex v and the eigenspace of µ i .In the case when the multiplicity of the eigenvalue µ i is 1, it is equal to (y i v ) 2 , the square of entry v of the µ i -eigenvector y i generating the one dimensional µ i -eigenspace.
Note that (2) can be written as We present our new proofs of Theorems 2 and 3 below, which will be used in the sequel.These follow directly from (2) and the concept of the type of vertex relative to E i .

Parameters Derived from the p-deck
Recall that the p-deck consists of the n characteristic polynomials of the subgraphs in D.
Theorem 2. (F.H.Clarke) [14] Let G be a graph and let φ(G, λ) be the characteristic polynomial of its 0-1-adjacency matrix.The derivative of the characteristic polynomial is given by As a diagonalizing matrix P is orthogonal, the length of each column vector is 1.Therefore, By integration of φ (G, λ), Theorem 2 of Clarke yields the following result immediately.

Corollary 2.
From the polynomial deck of the subspectra, all the coefficients in φ(G, λ) are derived, except for the constant term a 0 .
One of the most useful theorems in spectral graph theory is the Interlacing Theorem, also known as Cauchy's inequalities for a Hermitian matrix M. It gives the relative distribution of the eigenvalues of a graph and of those of a vertex-deleted subgraph.This is often key to establishing classes of polynomial reconstructible graphs.
The concept of the three possible types of vertices in a graph, associated with an eigenvalue µ of multiplicity η µ , is needed in the proof of the Interlacing theorem and in the sections that follow.
The type of a vertex is determined by the vth entries of an orthonormal set of eigenvectors of G [15,16].A non-zero entry at position v in some µ-eigenvector determines a µ-core vertex v and the dimension of the µ-eigenspace of G − v is η µ − 1.A µ-core forbidden vertex corresponds to a non-zero entry in all the µ-eigenvectors.It is a middle µ-core forbidden vertex if the dimension of the µ-eigenspace of G − v is η µ and an upper µ-core forbidden vertex if the dimension of the µ-eigenspace of G − v is η µ + 1.In linear algebraic literature, for µ = 0, upper µ-core-forbidden vertices are sometimes referred to as Parter vertices.They form a subset of the core-forbidden vertices, also known as Fiedler vertices [17].If each vertex of a graph G is a µ-core vertex, then G is referred to as a µ-core-graph.For a one dimensional µ-eigenspace, a µ-core-graph is called a µ-nut-graph.Its µ-eigenspace is generated by a full vector, with no zero entries.

Theorem 3. [Interlacing Theorem]
Let G be an n-vertex graph with vertex set V and let v ∈ V.
Proof.For a specific eigenvalue λ 0 , (2) above contains all the information regarding φ(G − v, λ) relative to the eigenspace E 0 , corresponding to λ 0 .The RHS of ( 2) is a rational function ψ(λ) with a number m(≤ s) of poles and m − 1 zeros, where m depends on v.A zero ξ i of ψ is an eigenvalue of G − v, lying strictly between two eigenvalues of G.
We distinguish three cases: Case I: If v is a λ 0 -core-vertex, then the vth entry y r v of some eigenvector y r ∈ E 0 is non-zero.Therefore, λ 0 is a pole in (2).Thus, the deletion of vertex v reduces the multiplicity of the eigenvalue λ 0 of G by one.Now the remaining two cases deal with a λ 0 -core-forbidden-vertex v.By definition y r v = 0, for all eigenvectors y r ∈ E 0 .Then, λ 0 is not a pole in (2).
Case II: If λ 0 is not a zero of the RHS of (2), then the same holds for the LHS.Hence the multiplicity of the eigenvalue λ 0 of G − v is the same as that of G.In this case v is a middle λ 0 -core-forbidden vertex Case III: If λ 0 is a zero of the RHS of (2), then the multiplicity of the eigenvalue λ 0 of G − v is one more than that of G and v is an upper λ 0 -core-forbidden vertex.
Thus, the deletion of a vertex causes a shift of the simple eigenvalues of the parent graph or changes the multiplicity of an eigenvalue by at most one.Therefore, eigenvalues of a daughter graph G − v lie between those of the parent graph G.This proves the Interlacing Theorem.

Eigenvalue-Based Invariant C i v of a Vertex
We now construct the graph invariant C i v for a vertex v.It is the contribution given by the entries v of the columns of P associated with E i .This has a direct application in the estimate of the electronic charge distribution among the carbon atoms of a hydrocarbon.
Using the notation in the proof of Theorem 2, let ) 2 be associated with vertex v.In the case when the multiplicity of the eigenvalue µ i is 1, it is equal to (y i v ) 2 , the square of entry v of the µ i -eigenvector y i generating the one dimensional µ-eigenspace.We note that Proof.As µ i -core vertices exist for all µ i , from Theorem 2, the multiplicity of (λ − µ i ) as a factor of the polynomial φ (G, λ) is η i − 1.By the Interlacing Theorem, the multiplicity of a µ i -eigenvalue of G − v differs from that of G by at most one.Therefore, we can write If v is a µ i -core-forbidden vertex, then for each , 1 ≤ ≤ η i , the entry y i v, = 0 and thus C i v = 0.In this case, the multiplicity of (λ Therefore, the limit in ( 7) is zero and ( 7) holds.
If on the other hand, v is a µ i -core vertex, then the multiplicity of (λ As λ approaches µ i , only one term does not vanish in the left hand side of (3).Thus, From ( 8) and ( 9), it follows that lim Theorem 4 establishes minimal data from which the parameter C i v can be calculated.The polynomials φ(G − v, λ) and φ(G, v) suffice to derive it.Note that C i v = 0 if and only if v is a core-forbidden vertex.

Corollary 4. The invariant C i
v of a graph G can be constructed from (i) the entries v of orthonormal vectors generating E i or (ii) µ i together with the spectra of G and of G − v.
For an eigenspace of dimension one, the entries of an eigenvector can be obtained up to sign from the spectrum of G and of G − v, 1 ≤ v ≤ n.From (7) the following result is immediate.Lemma 4. Let µ i be a simple eigenvalue of a graph G.Then, the spectrum of G and G − v alone suffices to yield each entry of the associated eigenvector up to sign.
For a graph whose eigenvalues are all simple the spectrum suffices to obtain all the eigenvector entries up to sign.Theorem 5.If G has distinct eigenvalues, then the v-entries of the µ i -eigenvector of length one can be obtained for all i, 1 ≤ i ≤ n, up to sign, from the spectrum of G and G − v.
Proof.If G has distinct eigenvalues, then the multiplicity η i of each eigenvalue µ i is one.Therefore, C i v = (y i v,1 ) 2 , the square of the entry v of the unit µ i -eigenvector is obtained from ( 7).
Note that for certain applications the square of the entry of a unit eigenvector suffices.For instance, ) 2 is the fractional electronic charge of the atom positioned at v at the energy level µ i of the molecule with adjacency matrix A. If the molecular graph has distinct eigenvalues, the fractional charge of an electron for energy µ i at the vth carbon atom of an unsaturated hydrocarbon or all-carbon molecule is given by (y i v,1 ) 2 .

Approaches to the Resolution of the PRP
From the p-deck and Corollary 2, we can determine immediately, for the parent graph H, the order n, the degree sequence, the number of edges, and the number of triangles.The p-deck even supplies the information required to obtain all the non-constant terms of φ(H, λ), but fails however to give a direct way of determining Det(A(H)) from which the constant term a 0 of the characteristic polynomial of H is derived.
In this section, we focus on counter examples to the positive resolution of the PRP among disconnected graphs with a common eigenvalue deck.One such graph could have the same p-deck as a connected graph G.If the graphs in a pair (H, G), of graphs with the same p-deck have different characteristic polynomial, the pair would be a counter example to the positive resolution of the PRP.
Note that graphs with an eigenvalue µ and an upper µ-core-forbidden-vertex have a repeated eigenvalue in a card of the p-deck and are therefore p-reconstructible.In this section, our ultimate aim is to seek potential candidates among disconnected simple graphs that could be counter examples to the positive solution of the PRP.From cited results, mostly from the work in [16], we deduce Corollary 6 in which the scope for further investigation is narrowed down to just two subclasses of disconnected graphs.We show, in Theorem 8, that a graph not having eigenvalue µ is reconstructible from a µ-eigenvector deck.We then consider the special case of a disconnected graph with two components, on the same number of vertices, having the eigenvalue µ and with each card of the deck showing µ of multiplicity one.We characterize the two components as µ-nut graphs in Theorem 10.

The Counter Example Technique
First, let us suppose that a graph H is not uniquely polynomial reconstructible.Then there exists a graph G such that H and G form a counter example pair to the PRP.Thus G is not co-spectral to H and φ(G, λ) is a reconstruction from P D(H).This technique reveals classes of graphs that are polynomial reconstructible without deriving the characteristic polynomial explicitly.
From Corollary 2, we deduce that the characteristic polynomials of H and of G differ only in the constant term a 0 .We shall assume that a 0 (H) = a 0 (G) + ∆a 0 where ∆a 0 > 0.
Immediate deductions are and that H and G are not isomorphic.iii G and H have no eigenvalue µ in common; otherwise, φ(G, µ) = φ(H, µ) = 0.This implies that the constant term of φ(G, λ) is the same as that of φ(H, λ).iv No polynomial in the p-deck P D(H) has a repeated eigenvalue µ.Otherwise, interlacing forces each of the graphs G and H to have the eigenvalue µ.By iii., this implies that G and H would be co-spectral.

A Disconnected Graph in a Counter Example Pair
We proceed to consider the PRP for disconnected graphs.Whether connectivity of G can be recognized from the p-deck {φ(G − v, λ)} v or not is an open problem to date.We settle the problem for all subclasses of disconnected graphs except two, specified in Corollary 6.
If a graph H is known to be disconnected, then its spectrum is recoverable from the p-deck.This follows as the maximum eigenvalue in the p-deck is also an eigenvalue of H. Recognizing that a graph is disconnected from the p-deck is proving to be hard to show.
We shall use the counter example approach to obtain subclasses of disconnected graphs that are polynomial reconstructible.
If a disconnected graph H is not uniquely polynomial reconstructible and (G, H) is a counter example pair to the PRP, then the two graphs H and G are not both disconnected.Henceforth, we shall assume that G is connected and that H is disconnected in a counter example pair (G, H) to the positive solution of the PRP.This is consistent with the condition a 0 (H) = a 0 (G) + ∆a 0 where ∆a 0 > 0.
A graph H is polynomial reconstructible if and only if no other graph has the same p-deck as H.In [18], subclasses {H} of the class of disconnected graphs that cannot share the same p-deck with any other graph are given.Theorem 6. [18] A disconnected graph that satisfies one of the following sufficient conditions, is polynomial reconstructible: , where ρ min is the minimum vertex degree of H.
An immediate consequence is that the PRP is still open for the disconnected graphs specified in the following result: Corollary 6.Let H be a disconnected graph with two components H 1 and H 2 on the same number of vertices.The graph H is reconstructible if H does not satisfy

Common Eigenvalue Deck
Next, we consider G µ , which denotes the class of n vertex-labeled graphs G with a common simple eigenvalue µ-deck.Lemma 6.Let µ be a simple eigenvalue of each of the n subgraphs G − v, 1 ≤ v ≤ n, of a graph G.Then, either µ is a repeated eigenvalue of G of multiplicity two or µ is not an eigenvalue of G.
In [16], it is shown that for G ∈ G µ in Class I, the associated µ-eigenspaces alone suffice to reconstruct a parent graph that does not have µ as an eigenvalue.We provide a sketch of the proof.The kth partial-µ-eigenvector y k of H is obtained from the µ-eigenvector z k of H − v k by inserting an entry 0 in the kth position.Reconstruction from eigenvectors demands that the parent graph be labeled.This follows since permutations of entries not of the same value need not remain eigenvectors.Theorem 7 ([16]).Let µ be a real number.Consider a labeled parent graph G on n > 2 vertices whose deck consists of cards representing subgraphs each of which has the eigenvalue µ of multiplicity one.If the columns of matrix Q are the n partial-µ-eigenvectors y i , 1 ≤ i ≤ n, of G, then, depending on the invertibility of Q, we have (i) if Q is non-singular, then µ is not an eigenvalue of G. (ii) if Q is singular, then rank(Q) = 2 and µ is an eigenvalue of G with multiplicity two.
Proof.Let G be a labeled graph in G µ with 0-1 adjacency matrix A and R i be the i-th row of (A(G) − µI).By definition of z i = (z ( ),i ), R i y i = 0, 1 ≤ i ≤ n and µ is not an eigenvalue of G.This proves (i).Now, if Q is singular, then R i y i = 0, for some i.Thus, y i would be a µ-eigenvector of G.However, then the dimension of the µ-eigenspace of G is two and G is a µ-core graph.A fortiori, R i y i = 0, for all i.Moreover the rank of Q is the dimension of the µ-eigenspace, which is less than n.
This completes the proof.
For a graph in Class I, Theorem 7 presents an algorithm that constructs, from the sequence of the generators of the µ-eigenvectors of the subgraphs in the deck, the labeled parent graph G directly.Moreover it gives also the value of µ.Theorem 8. Let µ be a real number.For n ≥ 3, let G be a n-vertex graph that does not have µ in its spectrum and has the simple eigenvalue µ in each card of its p-deck.From the sequence of the µ-eigenvectors of the vertex-deleted subgraphs in the deck, relative to some vertex-labeling of G, (i.) the labeled graph G is reconstructible; (ii.) the unique eigenvalue µ can be obtained.
Proof.Using the notation of Theorem 7, since the graph G does not have the eigenvalue µ, then (A(G) − µI) −1 exists.In (10), the k-th column of (A(G) − µI) −1 is a scalar multiple of the kth partial-µ-eigenvector y k of H, obtained from the µ-eigenvector z k of H − v k .
Thus, Diag(R 1 y 1 , R 2 y 2 , . . ., R n y n ) = 0, that is, R i y i = 0, for all i; otherwise, G would have the eigenvalue µ.As each entry of A is 0 or 1, the i-th column of (A(G) − µI) −1 is y i R i y i .
Thus A can be obtained and hence the labeled graph G is reconstructible from (10).This proves (i.) To prove (ii.), recalling that a diagonal entry of A is 0, µ = −R i y i (Q −1 ) ii .

Subclasses of Disconnected Graphs with a Common Eigenvalue Deck
Our ultimate objective is to determine the subclasses of the class of disconnected graphs which may not be polynomial reconstructible.From Corollary 6, we may assume in the sequel, that H is a disconnected graph H 1 ∪H 2 with |H 1 | = |H 2 |.The maximum eigenvalue of H is also the maximum eigenvalue that appears in the p-deck.If (H, G) is a counter example pair to the positive resolution of the PRP, then G must be connected, as otherwise H and G would have a common eigenvalue.Let the multiplicity of µ in each card of the p-deck be 1.By Lemma 6, µ is an eigenvalue of H of multiplicity zero or two.We now consider the disconnected graphs H = H 1 ∪H Proof.(i) If µ is not an eigenvalue of H, then the multiplicity of the eigenvalue µ increased with a vertex-deletion from H. Hence each vertex of H is an upper µ-core forbidden vertex.In this case, from Theorem 8, the labeled graph H is reconstructible from a sequence of µ eigenvectors of H − v, 1 ≤ v ≤ n.
(ii) By Lemma 6, there is only one remaining case.If µ is an eigenvalue of both H 1 and H 2 , then the multiplicity of the eigenvalue µ decreased with a vertex-deletion from H. Hence each vertex of H is a µ-core vertex.
A disconnected graph H in Class I and a partner graph G in a counter example pair to the positive resolution of the PRP are non-isomorphic and have different sequences of µ-eigenvectors of their respective p-decks.Moreover they are not co-spectral.To date we know of no such examples.
For graphs in Class II, there is a combinatorial characterization.

Concluding Remarks
We have proved that potential counter examples to the PRP may occur in both Classes I and II.From a sequence of µ eigenvectors, graphs in Class I and µ can be reconstructed.A disconnected graph in Class II has a combinatorial characterization as the disjoint union of two µ-nut-graphs of the same order but has not been explicitly constructed.Note that µ-nut-graphs characterize the class of connected graphs and consist precisely of those graphs K that can be reconstructed from a single vertex-deleted subgraph together with the generator of the µ-eigenspace of K [19].
The PRP is also still open for disconnected graphs H = H 1 ∪H 2 , with |H 1 | = |H 2 |, without a common eigenvalue deck.Were such a graph to exist, it would have a connected graph as a partner in a counter example pair, with the same p-deck, which could give more than one polynomial reconstruction.These results could be seen in the context of the recognition of connectivity from the p-deck.The problem is therefore still open.
1. if the number of components of H is more than two; or 2. if H = H 1 +H 2 and satisfies one of the following: (a) n(H 1 ) = n(H 2 ); (b) H i and H j − v, i = j, i, j ∈ {1, 2} have a common eigenvalue.(c) one of the components has a repeated eigenvalue; (d) the second larger eigenvalue of one component H i is greater than the maximum eigenvalue of H j 2 , with |H 1 | = |H 2 |, within Classes I and II.Let the n vertex graph H be disconnected.Let H = H 1 ∪H 2 , with |H 1 | = |H 2 | with a common simple eigenvalue µ-deck.Then, either (i) H belongs to Class I and every vertex of H is µ-upper core-forbidden, H does not have the eigenvalue µ. and can be reconstructed from the sequence of the n µ-eigenvectors of H − v, 1 ≤ v ≤ n; or (ii) H belongs to Class II and every vertex of H is a µ-core vertex.

Theorem 10 .
Let µ be a real number.For n ≥ 3, let H = H 1 ∪H 2 , with |H 1 | = |H 2 |, and a common µ-eigenvalue deck.If η µ (H) = 2 and H is a graph in a counter example pair to the positive solution of the PRP, then each of the subgraphs H 1 and H 2 are µ-nut graphs, that is a µ-eigenvector in each subgraph has no entry zero.Proof.The graph H is in Class II.None of the components H 1 or H 2 can have µ of multiplicity two, as otherwise the repeated root µ would appear in the p-deck.Hence each of the subgraphs H 1 and H 2 has nullity one.As each vertex is a µ-core vertex, then H is a µ-core graph.Therefore, each of the subgraphs H 1 and H 2 is a µ-nut graphs, that is a µ-eigenvector in each subgraph has no entry zero.