The skew energy of random oriented graphs

Given a graph $G$, let $G^\sigma$ be an oriented graph of $G$ with the orientation $\sigma$ and skew-adjacency matrix $S(G^\sigma)$. The skew energy of the oriented graph $G^\sigma$, denoted by $\mathcal{E}_S(G^\sigma)$, is defined as the sum of the absolute values of all the eigenvalues of $S(G^\sigma)$. In this paper, we study the skew energy of random oriented graphs and formulate an exact estimate of the skew energy for almost all oriented graphs by generalizing Wigner's semicircle law. Moreover, we consider the skew energy of random regular oriented graphs $G_{n,d}^\sigma$, and get an exact estimate of the skew energy for almost all regular oriented graphs.Comment: 12 pages. arXiv admin note: text overlap with arXiv:1011.6646 by other author

Chemical Self Assembly of Graphene Sheets

Chemically derived graphene sheets were found to self-assemble onto patterned gold structures via electrostatic interactions between noncovalent functional groups on GS and gold. This afforded regular arrays of single graphene sheets on large substrates, characterized by scanning electron and Auger microscopy imaging and Raman spectroscopy. Self assembly was used for the first time to produce on-substrate and fully-suspended graphene electrical devices. Molecular coatings on the GS were removed by high current electrical annealing, which recovered the high electrical conductance and Dirac point of the GS. Molecular sensors for highly sensitive gas detections are demonstrated with self-assembled GS devices.Comment: Nano Research, in press, http://www.thenanoresearch.co

Rainbow kk-connectivity of random bipartite graphs

A path in an edge-colored graph $G$ is called a rainbow path if no two edges of the path are colored the same. The minimum number of colors required to color the edges of $G$ such that every pair of vertices are connected by at least $k$ internally vertex-disjoint rainbow paths is called the rainbow $k$-connectivity of the graph $G$, denoted by $rc_k(G)$. For the random graph $G(n,p)$, He and Liang got a sharp threshold function for the property $rc_k(G(n,p))\leq d$. In this paper, we extend this result to the case of random bipartite graph $G(m,n,p)$.Comment: 15 pages. arXiv admin note: text overlap with arXiv:1012.1942 by other author