Back to Search
Start Over
Some extremal results on the connective eccentricity index of graphs.
- Source :
-
Journal of Mathematical Analysis & Applications . Jan2016, Vol. 433 Issue 2, p803-817. 15p. - Publication Year :
- 2016
-
Abstract
- The connective eccentricity index (CEI) of a graph G is defined as ξ ce ( G ) = ∑ v i ∈ V ( G ) d ( v i ) ε ( v i ) where ε ( v i ) and d ( v i ) are the eccentricity and the degree of vertex v i , respectively, in G . In this paper we obtain some lower and upper bounds on the connective eccentricity index for all trees of order n and with matching number β and characterize the corresponding extremal trees. And the maximal graphs of order n and with matching number β and n edges have been determined which maximize the connective eccentricity index. Also the extremal graphs with maximal connective eccentricity index are completely characterized among all connected graphs of order n and with matching number β . Moreover we establish some relations between connective eccentricity index and eccentric connectivity index, as another eccentricity-based invariant, of graphs. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 0022247X
- Volume :
- 433
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Journal of Mathematical Analysis & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 109553437
- Full Text :
- https://doi.org/10.1016/j.jmaa.2015.08.027