SCIDAR - A Digital Archive of the University of Kragujevac
A digital archive of the University of Kragujevac contains easily searchable and up-to-date research results.
Please use this identifier to cite or link to this item:
https://scidar.kg.ac.rs/handle/123456789/11666Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Gutman, Ivan | - |
| dc.contributor.author | Medina, Luis | - |
| dc.contributor.author | Pizarro P. | - |
| dc.contributor.author | Robbiano M. | - |
| dc.date.accessioned | 2021-04-20T18:56:00Z | - |
| dc.date.available | 2021-04-20T18:56:00Z | - |
| dc.date.issued | 2016 | - |
| dc.identifier.issn | 0012-365X | - |
| dc.identifier.uri | https://scidar.kg.ac.rs/handle/123456789/11666 | - |
| dc.description.abstract | © 2016 Elsevier B.V. All rights reserved. The Laplacian Estrada index (LEE) and the signless Laplacian Estrada index (SLEE) of a graph G are, respectively, the sum of the exponentials of the eigenvalues of the Laplacian and signless Laplacian matrix of G. The vertex frustration index υb of a graph G is the minimum number of vertices whose deletion from G results in a bipartite graph. Graphs having maximum LEE and SLEE values are determined among graphs with n vertices and 1≤υb≤n-3. | - |
| dc.rights | restrictedAccess | - |
| dc.source | Discrete Mathematics | - |
| dc.title | Graphs with maximum Laplacian and signless Laplacian Estrada index | - |
| dc.type | article | - |
| dc.identifier.doi | 10.1016/j.disc.2016.04.022 | - |
| dc.identifier.scopus | 2-s2.0-84973562887 | - |
| Appears in Collections: | Faculty of Science, Kragujevac | |
 | Page views(s)119 | Downloads(s)7 |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| PaperMissing.pdf Restricted Access | 29.86 kB | Adobe PDF |  View/Open |
Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.