Molecular trees with the sixth, seventh and eighth minimal irregularity values
DOI10.1142/S1793830919500022zbMATH Open1404.05026OpenAlexW2900385113WikidataQ128973011 ScholiaQ128973011MaRDI QIDQ4621299FDOQ4621299
Ali Ghalavand, A. R. Ashrafi, Akbar Ali
Publication date: 11 February 2019
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830919500022
Recommendations
- More results on extremum Randic indices of (molecular) trees
- scientific article; zbMATH DE number 7688017
- scientific article; zbMATH DE number 7655730
- Sum-connectivity index of molecular trees
- On extremum geometric-arithmetic indices of (molecular) trees
- scientific article; zbMATH DE number 7771350
- scientific article; zbMATH DE number 6851886
- On a family of trees with minimal atom-bond connectivity index
- Further properties of trees with minimal atom-bond connectivity index
Applications of graph theory (05C90) Trees (05C05) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Structural characterization of families of graphs (05C75)
Cites Work
- Spektren endlicher Grafen
- The second minimum of the irregularity of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The irregularity of graphs under graph operations
- A note on the irregularity of graphs
- Title not available (Why is that?)
- On the irregularity of bipartite graphs
- The irregularity of two types of trees
- Graphs with maximal irregularity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Variable neighborhood search for extremal graphs. IX: Bounding the irregularity of a graph
- Title not available (Why is that?)
- The irregularity of some composite graphs
- Some new results on irregularity of graphs
- Some new spectral bounds for graph irregularity
- A spectral bound for graph irregularity
- Centralities of a network and its line graph: an analytical comparison by means of their irregularity
- Comparing the irregularity and the total irregularity of graphs
- Title not available (Why is that?)
- Graphs with smallest forgotten index
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
This page was built for publication: Molecular trees with the sixth, seventh and eighth minimal irregularity values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4621299)