On the minimum eccentric distance sum of bipartite graphs with some given parameters
From MaRDI portal
Publication:2352882
DOI10.1016/j.jmaa.2015.05.032zbMath1316.05071OpenAlexW309712156MaRDI QIDQ2352882
Yueyu Wu, Shuchao Li, Lingli Sun
Publication date: 6 July 2015
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.2015.05.032
Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Connectivity (05C40)
Related Items (19)
On the maximal connective eccentricity index of bipartite graphs with some given parameters ⋮ Maximum \(H\)-index of bipartite network with some given parameters ⋮ Some edge-grafting transformations on the eccentricity resistance-distance sum and their applications ⋮ Weighted average geodesic distance of Vicsek network ⋮ Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs ⋮ AVERAGE GEODESIC DISTANCE OF NODE-WEIGHTED SIERPINSKI NETWORKS ⋮ Unnamed Item ⋮ Edge-grafting transformations on the average eccentricity of graphs and their applications ⋮ On the extremal total reciprocal edge-eccentricity of trees ⋮ On the extremal graphs of diameter 2 with respect to the eccentric resistance-distance sum ⋮ Extremal bipartite graphs and unicyclic graphs with respect to the eccentric resistance-distance sum ⋮ On the maximum value of the eccentric distance sums of cubic transitive graphs ⋮ Some further results on the eccentric distance sum ⋮ On the extremal graphs with respect to the total reciprocal edge-eccentricity ⋮ ECCENTRIC DISTANCE SUM OF SIERPIŃSKI GASKET AND SIERPIŃSKI NETWORK ⋮ Extremal trees of given segment sequence with respect to some eccentricity-based invariants ⋮ On extremal bipartite graphs with given number of cut edges ⋮ General eccentric distance sum of graphs ⋮ ECCENTRIC DISTANCE SUM OF SUBSTITUTION TREE NETWORKS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On eccentric distance sum and minimum degree
- On the eccentric distance sum of graphs
- On the eccentric distance sum of trees and unicyclic graphs
- On the distance spectral radius of bipartite graphs
- Further results on the eccentric distance sum
- On the degree distance of unicyclic graphs with given matching number
- The minimum degree distance of graphs of given order and size
- Wiener number of vertex-weighted graphs and a chemical application
- 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
- Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes
- Extremal values on the eccentric distance sum of trees
- Computing the eccentric-distance sum for graph operations
- On the sum of all distances in bipartite graphs
- On bags and bugs
- Edge-contributions of some topological indices and arboreality of molecular graphs
- On the extremal values of the eccentric distance sum of trees
- On the extremal values of the eccentric distance sum of trees
- Wiener index of trees: Theory and applications
This page was built for publication: On the minimum eccentric distance sum of bipartite graphs with some given parameters
