let $n$ be any positive integer, the friendship graph $f_n$ consists of $n$ edge-disjoint triangles that all of them meeting in one vertex. a graph $g$ is called cospectral with a graph $h$ if their adjacency matrices have the same eigenvalues. recently in href{http://arxiv.org/pdf/1310.6529v1.pdf}{http://arxiv.org/pdf/1310.6529v1.pdf} it is proved that if $g$ is any graph cospectral with $f_n$...

Overlapping recombinant clones that encompass the insulin-like growth factor (IGF) I and II genes have been isolated from a human genomic DNA library. Each gene is present once per haploid genome; the IGF-I gene spans greater than 35 kilobase pairs (kbp) and the IGF-II gene is at least 15 kbp. The exon-intron organization of these genes is similar, each having four exons, which is one more than...

Bipartite graph data increasingly occurs as a stream of edges that represent transactions, e.g., purchases by retail customers. Applications such as recommender systems employ neighborhood-based measures of node similarity, such as the pairwise number of common neighbors (CN) and related metrics. While the number of node pairs that share neighbors is potentially enormous, in real-word graphs on...