Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/17370
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCaporossi, Gilles-
dc.contributor.authorChasset, Emma-
dc.contributor.authorFurtula, Boris-
dc.date.accessioned2023-03-17T14:03:41Z-
dc.date.available2023-03-17T14:03:41Z-
dc.date.issued2009-
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/17370-
dc.description.abstractThe 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.isoen_USen_US
dc.relation.ispartofLes Cahiers du GERADen_US
dc.subjectDistance energyen_US
dc.subjectEigenvaluesen_US
dc.subjectDistance matrices of graphsen_US
dc.titleSome conjectures and properties on distance energyen_US
dc.typearticleen_US
dc.description.versionPublisheden_US
dc.type.versionPublishedVersionen_US
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

56

Downloads(s)

38

Files in This Item:
File Description SizeFormat 
paper0064.pdf146.37 kBAdobe PDFThumbnail
View/Open


Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.