ENERGIES OF GRAPHS SURVEY, CENSUS, BIBLIOGRAPHY Ivan Gutman & Boris Furtula
Page 1 ENERGIES OF GRAPHS SURVEY, CENSUS, BIBLIOGRAPHY Ivan Gutman & Boris …

The eccentricity matrix ɛ (G) of a graph G is obtained from the distance matrix D (G) by
retaining only for each row and each column the largest distance, and setting the remaining …

A graph is called a threshold graph if it does not contain induced C 4, P 4 or 2 K 2. Such
graphs have numerous applications in computer science and psychology, and they also …

Graham and Lovász conjectured in 1978 that the sequence of normalized coefficients of the
distance characteristic polynomial of a tree of order n is unimodal with the maximum value …

Abstract Let ρ (D (G)) denote the distance spectral radius of a graph G and∂(G→) denote
the distance signless Laplacian spectral radius of a digraph G→. Let G n, k D be the set of all …

The eccentricity matrix $\mathcal E (G) $ of a connected graph $ G $ is obtained from the
distance matrix of $ G $ by leaving unchanged the largest nonzero entries in each row and …

Let G be a simple connected graph of order n having Wiener index W\(G\). The distance,
distance Laplacian and the distance signless Laplacian energies of G are respectively …

The distance energy of clique trees - ScienceDirect Skip to main contentSkip to article Elsevier
logo Journals & Books Search RegisterSign in View PDF Download full issue Search …

The distance energy of a connected graph G is defined to be E (G)=∑ i= 1 n| λ i (G)|, where λ
1 (G),…, λ n (G) are distance eigenvalues of G. Recently, much research has explored the …

The distance spectral radius of a graph is the largest eigenvalue of its distance matrix. XL
Zhang (2012)[31] determined the n-vertex graphs of given diameter with the minimum …