Lower bounds on trees and unicyclic graphs with respect to the misbalance rodeg index.

Heliyon

Department of Computer and Information Sciences, Northumbria University, Newcastle, NE1 8ST, UK.

Published: January 2025

The Misbalance Rodeg () index stands out among the 148 discrete Adriatic indices demonstrating considerable predictive capabilities in evaluations carried out by the International Academy of Mathematical Chemistry. This index excels particularly in forecasting both the enthalpy and the standard enthalpy of vaporization for octane isomers. Despite its significant chemical applicability, the index has not been extensively explored in the literature. One objective of this study is to highlight the importance of this graph invariant to the mathematical chemistry community by examining various mathematical properties associated with it. Our investigation specifically aims to ascertain the minimal values of the index for all trees and unicyclic graphs with a given order and maximum vertex degree. Additionally, we extend our analysis to molecular trees and provide a characterization of the respective minimal trees and unicyclic graphs.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC11728926PMC
http://dx.doi.org/10.1016/j.heliyon.2024.e41235DOI Listing

Publication Analysis

Top Keywords

trees unicyclic
12
unicyclic graphs
12
misbalance rodeg
8
mathematical chemistry
8
lower bounds
4
trees
4
bounds trees
4
graphs respect
4
respect misbalance
4
rodeg misbalance
4

Similar Publications

Lower bounds on trees and unicyclic graphs with respect to the misbalance rodeg index.

Heliyon

January 2025

Department of Computer and Information Sciences, Northumbria University, Newcastle, NE1 8ST, UK.

The Misbalance Rodeg () index stands out among the 148 discrete Adriatic indices demonstrating considerable predictive capabilities in evaluations carried out by the International Academy of Mathematical Chemistry. This index excels particularly in forecasting both the enthalpy and the standard enthalpy of vaporization for octane isomers. Despite its significant chemical applicability, the index has not been extensively explored in the literature.

View Article and Find Full Text PDF

We compute the Castelnuovo-Mumford regularity of the quotient rings of edge ideals of perfect -ary trees and some unicyclic graphs.

View Article and Find Full Text PDF

Further development of F-index for fuzzy graph and its application in Indian railway crime.

J Appl Math Comput

May 2022

Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore, 721102 India.

From the mid-nineteenth century, the railway network has been the most important mode of conveying people and goods in India. 22.15 million passengers used this network and 3.

View Article and Find Full Text PDF

On the Extremal Wiener Polarity Index of Hückel Graphs.

Comput Math Methods Med

March 2017

Faculty of Mathematics and Physics, Huaiyin Institute of Technology, Huai'an, Jiangsu 223003, China.

Graphs are used to model chemical compounds and drugs. In the graphs, each vertex represents an atom of molecule and edges between the corresponding vertices are used to represent covalent bounds between atoms. The Wiener polarity index W p (G) of a graph G is the number of unordered pairs of vertices u, v of G such that the distance between u and v is equal to 3.

View Article and Find Full Text PDF

Unicyclic networks: compatibility and enumeration.

IEEE/ACM Trans Comput Biol Bioinform

November 2006

Biomathematics Research Centre, Department of Mathematics and Statistics, University of Canterbury, Private Bag 4800, Christchurch, New Zealand.

Graphs obtained from a binary leaf labeled ("phylogenetic") tree by adding an edge so as to introduce a cycle provide a useful representation of hybrid evolution in molecular evolutionary biology. This class of graphs (which we call "unicyclic networks") also has some attractive combinatorial properties, which we present. We characterize when a set of binary phylogenetic trees is displayed by a unicyclic network in terms of tree rearrangement operations.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!