| 作成者 |
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
Energy has been studied in mathematical perspective as well as physical perspective for several years ago. In spectral graph theory, the eigenvalues of several kinds of matrices have been studied, of ...which Laplacian matrix attracted the greatest attention [5]. Recently, in 2009, Adiga considered Laplacian energy of directed graphs using skew Laplacian matrix, in which degree of vertex is considered as total of the out-degree and the in-degree. Since directed graphs play an important role in identifying the structure of web-graphs as well as communication graphs, we consider Laplacian energy of simple directed graphs and find some relations by using the general definition of Laplacian matrix. Unlike in [1], we derived two types of equations for simple directed graphs and symmetric directed graphs with $n ≥2$ vertices by considering out-degree of vertex. Further we consider the class $P(alpha)$ which consists of non isomorphic graphs with energy less than some $alpha$ and find 47 non isomorphic directed graphs for class $P(10)$. Our objective extended to enumerate the structure of directed graphs using the Laplacian energy concept. Minimization maximum outdegree(MMO) algorithm defined in [3] can be used to find the directed graphs with minimum Laplacian energy.続きを見る
|
Mendeley出力
MI2010-35(2)