It is well known that graph spectra store a lot of structural information about a graph,and it is more difficult to compute the spectra of corona graphs. In this paper two classes of new corona graphs,the corona-verte...It is well known that graph spectra store a lot of structural information about a graph,and it is more difficult to compute the spectra of corona graphs. In this paper two classes of new corona graphs,the corona-vertex of the subdivision graph G1◇G2and corona-edge of the subdivision graph G1☆G2were defined. Then,by using the coronal of a graph and some knowledge of linear algebra,the adjacency spectra and the signless Laplacian spectra of the two new graphs were explicitly computed in terms of the corresponding spectra of G1 and G2. As the application,some Aintegral graphs were constructed.展开更多
<div style="text-align:justify;"> <span style="font-family:Verdana;">A graph is said to be cordial if it has 0 - 1 labeling which satisfies particular conditions. In this paper, we cons...<div style="text-align:justify;"> <span style="font-family:Verdana;">A graph is said to be cordial if it has 0 - 1 labeling which satisfies particular conditions. In this paper, we construct the corona between paths and second power of fan graphs and explain the necessary and sufficient conditions for this construction to be cordial.</span> </div>展开更多
基金National Natural Science Foundation of China(No.11361033)Natural Science Foundation of Gansu Province,China(No.1212RJZA029)
文摘It is well known that graph spectra store a lot of structural information about a graph,and it is more difficult to compute the spectra of corona graphs. In this paper two classes of new corona graphs,the corona-vertex of the subdivision graph G1◇G2and corona-edge of the subdivision graph G1☆G2were defined. Then,by using the coronal of a graph and some knowledge of linear algebra,the adjacency spectra and the signless Laplacian spectra of the two new graphs were explicitly computed in terms of the corresponding spectra of G1 and G2. As the application,some Aintegral graphs were constructed.
文摘<div style="text-align:justify;"> <span style="font-family:Verdana;">A graph is said to be cordial if it has 0 - 1 labeling which satisfies particular conditions. In this paper, we construct the corona between paths and second power of fan graphs and explain the necessary and sufficient conditions for this construction to be cordial.</span> </div>
