Displaying similar documents to “Matrix and discrepancy view of generalized random and quasirandom graphs”

Partitions of networks that are robust to vertex permutation dynamics

Gary Froyland, Eric Kwok (2015)

Special Matrices

Similarity:

Minimum disconnecting cuts of connected graphs provide fundamental information about the connectivity structure of the graph. Spectral methods are well-known as stable and efficient means of finding good solutions to the balanced minimum cut problem. In this paper we generalise the standard balanced bisection problem for static graphs to a new “dynamic balanced bisection problem”, in which the bisecting cut should be minimal when the vertex-labelled graph is subjected to a general sequence...

Spectral characterization of multicone graphs

Jianfeng Wang, Haixing Zhao, Qiongxiang Huang (2012)

Czechoslovak Mathematical Journal

Similarity:

A multicone graph is defined to be the join of a clique and a regular graph. Based on Zhou and Cho's result [B. Zhou, H. H. Cho, Remarks on spectral radius and Laplacian eigenvalues of a graph, Czech. Math. J. 55 (130) (2005), 781–790], the spectral characterization of multicone graphs is investigated. Particularly, we determine a necessary and sufficient condition for two multicone graphs to be cospectral graphs and investigate the structures of graphs cospectral to a multicone graph....