Please use this identifier to cite or link to this item:
https://scidar.kg.ac.rs/handle/123456789/17370
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Caporossi, Gilles | - |
dc.contributor.author | Chasset, Emma | - |
dc.contributor.author | Furtula, Boris | - |
dc.date.accessioned | 2023-03-17T14:03:41Z | - |
dc.date.available | 2023-03-17T14:03:41Z | - |
dc.date.issued | 2009 | - |
dc.identifier.uri | https://scidar.kg.ac.rs/handle/123456789/17370 | - |
dc.description.abstract | The distance energy of a graph G is defined as \(ED(G) = \sum |\mu_i|\)|, where µi is the ith eigenvalue of the distance matrix of G. In this paper, we express the distance spectra and distance energy of complete split graphs and graphs composed of two cliques joined by a matching. We also give some spectral properties of complete multipartite graphs. Finally, we identify structural and numerical conjectures on ED for graphs with number of vertices n and number of edges m are fixed. | en_US |
dc.language.iso | en_US | en_US |
dc.rights | info:eu-repo/semantics/openAccess | - |
dc.source | Les Cahiers du GERAD | - |
dc.subject | Distance energy | en_US |
dc.subject | Eigenvalues | en_US |
dc.subject | Distance matrices of graphs | en_US |
dc.title | Some conjectures and properties on distance energy | en_US |
dc.type | article | en_US |
dc.description.version | Published | en_US |
dc.type.version | PublishedVersion | en_US |
Appears in Collections: | Faculty of Science, Kragujevac |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
paper0064.pdf | 146.37 kB | Adobe PDF | View/Open |
Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.