There are several possible paths to take with this project. However, none of these paths appear to be particularly easy. We argue, without the intention of undermining its potentital for difficulty, that a natural step forward is to replace the weights appearing in (REF ) with the eigenvalues for the Laplacian and signless Laplacian of a random graph [1]}. We recall that the Laplacian of a simple graph \(G\)  of order \(n\)  is the symmetric \(n\times n\)  matrix \(L(G)\)  defined by
\(L(G)=D(G)-A(G),\) 
