On the maximal connective eccentricity index of bipartite graphs with some given parameters
From MaRDI portal
Publication:2360006
DOI10.1016/j.jmaa.2017.05.003zbMath1367.05119OpenAlexW2611911410MaRDI QIDQ2360006
Shuchao Li, Huihui Zhang, Hongshuai Li
Publication date: 23 June 2017
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2017.05.003
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Vertex degrees (05C07)
Related Items (9)
On the general degree-eccentricity index of a graph ⋮ On the extremal connective eccentricity index among trees with maximum degree ⋮ Maximum \(H\)-index of bipartite network with some given parameters ⋮ On connected graphs having the maximum connective eccentricity index ⋮ Graphs having extremal monotonic topological indices with bounded vertex \(k\)-partiteness ⋮ On the extremal graphs with respect to the total reciprocal edge-eccentricity ⋮ On extremal bipartite graphs with given number of cut edges ⋮ On the maximum connective eccentricity index among k-connected graphs ⋮ Some extremal problems on the distance involving peripheral vertices of trees with given matching number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the extreme eccentric distance sum of graphs with some given parameters
- Some edge-grafting transformations on the eccentricity resistance-distance sum and their applications
- On the extremal properties of the average eccentricity
- On the connective eccentricity index of trees and unicyclic graphs with given diameter
- On eccentric distance sum and minimum degree
- The connectivity and the Harary index of a graph
- On the extremal total reciprocal edge-eccentricity of trees
- Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications
- On the extremal graphs of diameter 2 with respect to the eccentric resistance-distance sum
- On the eccentric connectivity index of a graph
- On the eccentric distance sum of graphs
- The eccentric connectivity index of nanotubes and nanotori
- Trees with the seven smallest and eight greatest Harary indices
- Application of graph theory: Relationship of eccentric connectivity index and Wiener's index with anti-inflammatory activity
- 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
- Extremal values on the eccentric distance sum of trees
- The relationship between the eccentric connectivity index and Zagreb indices
- On the sum of all distances in bipartite graphs
- On augmented eccentric connectivity index of graphs and trees
- The Harary index of trees
- Edge-contributions of some topological indices and arboreality of molecular graphs
- Eccentric Connectivity Index of Chemical Trees
- On the extremal values of the eccentric distance sum of trees
- On the extremal values of the eccentric distance sum of trees
This page was built for publication: On the maximal connective eccentricity index of bipartite graphs with some given parameters
