A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Random walks on complete multipartite graphs

2015
*
Pure and Applied Mathematics Quarterly
*

Let G n be a simple graph with n vertices. Gutman and Wagner founded the theory of random graphs, they introduced the matching energy of the graph G n , which was defined as the sum of the absolute values of the eigenvalues of the matching polynomial of the graph G n . For the Erdös-Rényi type random graph G n,p of order n with a fixed probability p, where p is a real number greater than zero and less than 1, that is, the graph G on n vertices by connecting two vertices with probability p(e),

doi:10.4310/pamq.2015.v11.n3.a1
fatcat:xglb7na3yfe4bem544qwon5ase