On Kirchhoff Index and Resistance-Distance Energy of a Graph
Kinkar Chandra Das, A. Dilek, Ahmet Sinan Cevik
Abstract
Kinkar Chandra Das, A. Dilek, Ahmet Sinan Cevik
Abstract
We report lower bounds for the Kirchhoff index of a connected (molecular) graph in terms of its structural parameters such as the number of vertices (atoms), the number of edges (bonds), maximum vertex degree (valency), second maximum vertex degree and minimum vertex degree. Also we give the Nordhaus–Gaddum-type result for Kirchhoff index. In this paper we define the resistance distance energy as the sum of the absolute values of the eigenvalues of the resistance distance matrix and also we obtain lower and upper bounds for this energy.
OpenAlex reports 18 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We report lower bounds for the Kirchhoff index of a connected (molecular) graph in terms of its structural parameters such as the number of vertices (atoms), the number of edges (bonds), maximum vertex degree (valency), second maximum vertex degree and minimum vertex degree. Also we give the Nordhaus–Gaddum-type result for Kirchhoff index. In this paper we define the resistance distance energy as the sum of the absolute values of the eigenvalues of the resistance distance matrix and also we obtain lower and upper bounds for this energy.
Key concepts: Resistance distance, Valency, Mathematics, Combinatorics, Graph energy, Vertex (graph theory), Distance matrix, Eigenvalues and eigenvectors