On the extremal total reciprocal edge-eccentricity of trees

DOI10.1016/J.JMAA.2015.07.057zbMATH Open1321.05045arXiv1508.05690OpenAlexW2108074831MaRDI QIDQ497777FDOQ497777

Authors: Shuchao Li, Lifang Zhao 

Publication date: 25 September 2015

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Abstract: The total reciprocal edge-eccentricity is a novel graph invariant with vast potential in structure activity/property relationships. This graph invariant displays high discriminating power with respect to both biological activity and physical properties. If $G=(V_G,E_G)$ is a simple connected graph, then the total reciprocal edge-eccentricity (REE) of $G$ is defined as $x{i}^{ee}(G)=su{m}_{uvin{E}_G}(1/varepsilo{n}_G(u)+1/varepsilo{n}_G(v))$, where $varepsilo{n}_G(v)$ is the eccentricity of the vertex $v$. In this paper we first introduced four edge-grafting transformations to study the mathematical properties of the reciprocal edge-eccentricity of $G$. Using these elegant mathematical properties, we characterize the extremal graphs among $n$-vertex trees with given graphic parameters, such as pendants, matching number, domination number, diameter, vertex bipartition, et al. Some sharp bounds on the reciprocal edge-eccentricity of trees are determined.

Full work available at URL: https://arxiv.org/abs/1508.05690

Recommendations

• On the extremal graphs with respect to the total reciprocal edge-eccentricity
• Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications
• On the reformulated reciprocal sum-degree distance of graph transformations
• On the eccentric distance sum of graphs
• On the extremal values of the eccentric distance sum of trees

zbMATH Keywords

diameterconnectivitymatching numberedge-eccentricityreciprocal edge-eccentricity

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Graph theory
• Comparison of graphs by their number of spanning trees
• Extremal values on the eccentric distance sum of trees
• Walks and paths in trees
• The eccentric connectivity index of nanotubes and nanotori
• Edge-grafting theorems on permanents of Laplacian matrices of graphs and their applications
• Trees with the seven smallest and eight greatest Harary indices
• Trees with minimal Laplacian coefficients
• Application of graph theory: Relationship of eccentric connectivity index and Wiener's index with anti-inflammatory activity
• On the sum of all distances in bipartite graphs
• On eccentric distance sum and minimum degree
• On the eccentric connectivity index of a graph
• On the eccentric distance sum of graphs
• On the extremal values of the eccentric distance sum of trees
• Title not available (Why is that?)
• Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
• On the minimum eccentric distance sum of bipartite graphs with some given parameters
• On the extremal values of the eccentric distance sum of trees
• On the extremal properties of the average eccentricity
• Eccentric Connectivity Index of Chemical Trees
• On augmented eccentric connectivity index of graphs and trees
• On the connective eccentricity index of trees and unicyclic graphs with given diameter
• On connective eccentricity index of graphs
• The Harary index of trees
• The connectivity and the Harary index of a graph
• The relationship between the eccentric connectivity index and Zagreb indices
• On AGX conjectures regarding average eccentricity

Cited In (13)

• On the eccentric subtree number in trees
• On the maximal connective eccentricity index of bipartite graphs with some given parameters
• On connected graphs having the maximum connective eccentricity index
• On the extremal connective eccentricity index among trees with maximum degree
• On the maximum connective eccentricity index among k-connected graphs
• On the extremal graphs with respect to the total reciprocal edge-eccentricity
• On the extremal values of the eccentric distance sum of trees with a given maximum degree
• Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications
• Edge-grafting transformations on the average eccentricity of graphs and their applications
• On the minimal eccentric connectivity indices of bipartite graphs with some given parameters
• Title not available (Why is that?)
• Extremal trees of given segment sequence with respect to some eccentricity-based invariants
• On extremal bipartite graphs with given number of cut edges

This page was built for publication: On the extremal total reciprocal edge-eccentricity of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497777)