Further results on the Merrifield-Simmons index
DOI10.1016/J.DAM.2020.01.009zbMATH Open1442.05036OpenAlexW3003053881MaRDI QIDQ2192080FDOQ2192080
Hongzhuan Wang, Xinying Hua, Hongbo Hua
Publication date: 29 June 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.01.009
comparisonextremal problemindependent subsetsMerrifield-Simmons indexdistance-based graph invariants
Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Structural characterization of families of graphs (05C75) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Wiener index of trees: Theory and applications
- Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes
- On the peripheral Wiener index of graphs
- Improved bounds on the difference between the Szeged index and the Wiener index of graphs
- On Wiener and multiplicative Wiener indices of graphs
- THE MULTIPLICATIVE VERSION OF WIENER INDEX
- WIENER INDEX OF TREES OF GIVEN ORDER AND DIAMETER AT MOST
- Proof of conjectures on remoteness and proximity in graphs
- Proximity and remoteness in graphs: Results and conjectures
- The difference between remoteness and radius of a graph
- Graphs with given number of cut vertices and extremal Merrifield-Simmons index
- On the Wiener polarity index of trees with maximum degree or given number of leaves
- The Nordhaus-Gaddum-type inequality for the Wiener polarity index
- On the Wiener polarity index of graphs
- The average distance and the independence number
- On the connective eccentricity index of trees and unicyclic graphs with given diameter
- A sharp upper bound for the number of stable sets in graphs with given number of cut edges
- On eccentric distance sum and degree distance of graphs
- The relationship between the eccentric connectivity index and Zagreb indices
- Spanning trees with many leaves and average distance
- The number of independent sets in unicyclic graphs with a given diameter
- On the extremal Merrifield-Simmons index and Hosoya index of quasi-tree graphs
- Comparison between the zeroth-order Randić index and the sum-connectivity index
- Relations between distance-based and degree-based topological indices
- On the eccentric complexity of graphs
- Comparison between the Szeged index and the eccentric connectivity index
Cited In (7)
- Comparison between Merrifield-Simmons index and Wiener index of graphs
- Matching polynomials and independence polynomials of benzenoid chains
- A simulation study on the hybrid nature of Tango's index
- On the Merrifield-Simmons index of tricyclic graphs
- Comparison between Merrifield-Simmons index and some vertex-degree-based topological indices
- On conjecture of Merrifield-Simmons index
- Title not available (Why is that?)
Uses Software
This page was built for publication: Further results on the Merrifield-Simmons index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2192080)