Maximum Eccentric Connectivity Index for Graphs with Given Diameter

08/30/2018
by   Pierre Hauweele, et al.
0

The eccentricity of a vertex v in a graph G is the maximum distance between v and any other vertex of G. The diameter of a graph G is the maximum eccentricity of a vertex in G. The eccentric connectivity index of a connected graph is the sum over all vertices of the product between eccentricity and degree. Given two integers n and D with D≤ n-1, we characterize those graphs which have the largest eccentric connectivity index among all connected graphs of order n and diameter D. As a corollary, we also characterize those graphs which have the largest eccentric connectivity index among all connected graphs of a given order n.

READ FULL TEXT
research
09/10/2018

Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices

The eccentric connectivity index of a connected graph G is the sum over ...
research
09/22/2021

On the Connectivity and the Diameter of Betweenness-Uniform Graphs

Betweenness centrality is a centrality measure based on the overall amou...
research
01/09/2018

Structure Entropy and Resistor Graphs

We propose the notion of resistance of a graph as an accompanying notio...
research
05/04/2023

Maximum values of the Sombor-index-like graph invariants of connected graphs

A set of novel vertex-degree-based invariants, similar to the Sombor-ind...
research
08/17/2018

Realization and Connectivity of the Graphs of Origami Flat Foldings

We investigate the graphs formed from the vertices and creases of an ori...
research
01/16/2023

Computing Distance-based metrics on Very Large Graphs

We propose PROPAGATE, a fast approximation framework to estimate distanc...
research
07/18/2023

Maximal diameter of integral circulant graphs

Integral circulant graphs are proposed as models for quantum spin networ...

Please sign up or login with your details

Forgot password? Click here to reset