Nordhaus-Gaddum Type results for the Harary index of graphs
From MaRDI portal
Publication:4617703
DOI10.22052/ijmc.2017.67735.1254zbMath1406.92790OpenAlexW2611294930MaRDI QIDQ4617703
No author found.
Publication date: 7 February 2019
Full work available at URL: https://ijmc.kashanu.ac.ir/article_44759_734363f6c618442af36682e65ea7a7b1.pdf
Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Steiner Wiener index of a graph
- Upper bounds on the Steiner diameter of a graph
- The connectivity and the Harary index of a graph
- The Harary index of a graph
- Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs
- A graph and its complement with specified properties. I: Connectivity
- On the average Steiner distance of graphs with presribed properties
- Inverse problem on the Steiner Wiener index
- A survey of Nordhaus-Gaddum type relations
- Steiner distance and convexity in graphs
- Distance in Graphs
- Distance in graphs
- Steiner distance in graphs
- The Steiner diameter of a graph
- Three-center Harary index and its applications
- The average Steiner distance of a graph
- Average distance, minimum degree, and spanning trees
- Steiner centers in graphs
- Wiener index of trees: Theory and applications
