The minimum eccentric distance sum of trees with given distance k-domination number
From MaRDI portal
Publication:5858160
DOI10.1142/S1793830920500524zbMath1457.05055OpenAlexW3030177470MaRDI QIDQ5858160
Publication date: 9 April 2021
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830920500524
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
Unnamed Item ⋮ Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity ⋮ General eccentric distance sum of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the extreme eccentric distance sum of graphs with some given parameters
- On the eccentric distance sum of graphs
- On the eccentric distance sum of trees and unicyclic graphs
- On extremal Zagreb indices of trees with given domination number
- Further results on the eccentric distance sum
- A proof of the conjecture regarding the sum of domination number and average eccentricity
- Average distances and distance domination numbers
- Relations between packing and covering numbers of a tree
- Average distance and domination number
- Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs
- Further results regarding the sum of domination number and average eccentricity
- On eccentric distance sum and degree distance of graphs
- Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
- On the extremal values of the eccentric distance sum of trees with a given domination number
- Extremal values on the eccentric distance sum of trees
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Theory and Application of Graphs
- On the distance signless Laplacian spectral radius and the distance signless Laplacian energy of graphs
- On the sum of the distance signless Laplacian eigenvalues of a graph and some inequalities involving them
- On the domination number and the total domination number of Fibonacci cubes
- 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: The minimum eccentric distance sum of trees with given distance k-domination number