Energy of strongly connected digraphs whose underlying graph is a cycle
The energy of a digraph is defined as E (D) =∑1n|Re (z k)|, where z1,..., z n are the eigenvalues of the adjacency matrix of D. This is a generalization of the concept of energy introduced by I. Gutman in 1978. When the characteristic polynomial ofa digraph D is ofthe form <img width=38...
Guardado en:
| Autores principales: | , |
|---|---|
| Lenguaje: | English |
| Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2016
|
| Materias: | |
| Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172016000400003 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|