Izvorni znanstveni članak

On the distance spectra of some graphs

Gopalapillai Indulal ; Department of Mathematics, St.Aloysius College, Edathua, India
Ivan Gutman ; Faculty of Science, University of Kragujevac, Kragujevac, Serbia

Sažetak

The D-eigenvalues of a connected graph G are the eigenvalues of its distance matrix D, and form the D-spectrum of G. The D-energy E_{D}(G) of the graph G is the sum of the absolute values of its
D-eigenvalues. Two (connected) graphs are said to be
D-equienergetic if they have equal D-energies. The D-spectra
of some graphs and their D-energies are calculated. A pair of
D-equienergetic bipartite graphs on $24\,t$, $t \geq 3$,
vertices is constructed.

Ključne riječi

distance eigenvalue (of a graph); distance spectrum (of a graph); distance energy (of a graph); distance--equienergetic graphs

Hrčak ID:

23569

URI

https://hrcak.srce.hr/23569

Datum izdavanja:

28.5.2008.

Posjeta: 3.551 *