On Distance Energy of Graphs

Dyuthi/Manakin Repository

On Distance Energy of Graphs

Show simple item record

dc.contributor.author Gopalapillai,Indulal
dc.contributor.author Ivan,Gutman
dc.contributor.author Vijayakumar,Ambat
dc.date.accessioned 2008-08-07T07:49:02Z
dc.date.available 2008-08-07T07:49:02Z
dc.date.issued 2007-08-25
dc.identifier.uri http://dyuthi.cusat.ac.in/purl/626
dc.description.abstract The D-eigenvalues of a graph G are the eigenvalues of its distance matrix D, and the D-energy ED(G) is the sum of the absolute values of its D-eigenvalues. Two graphs are said to be D-equienergetic if they have the same D-energy. In this note we obtain bounds for the distance spectral radius and D-energy of graphs of diameter 2. Pairs of equiregular D-equienergetic graphs of diameter 2, on p = 3t + 1 vertices are also constructed. en_US
dc.language.iso en en_US
dc.publisher Department of Mathematics en_US
dc.subject D-eigenvalues en_US
dc.subject Graph G en_US
dc.subject D-energy en_US
dc.subject Spectral radius en_US
dc.title On Distance Energy of Graphs en_US
dc.type Working Paper en_US


Files in this item

Files Size Format View Description
7) ON DISTANCE ENERGY OF GRAPHS.pdf 2.839Mb PDF View/Open pdf

This item appears in the following Collection(s)

Show simple item record

Search Dyuthi


Advanced Search

Browse

My Account