You have already added 0 works in your ORCID record related to the merged Research product.
Some New Upper Bounds for the Y -Index of Graphs
Copyright policy )In mathematical chemistry, the topological indices with highly correlation factor play a leading role specifically for developing crucial information in QSPR/QSAR analysis. Recently, there exists a new graph invariant, namely, Y -index of graph proposed by Alameri as the sum of the fourth power of each and every vertex degree of that graph. The approximate range of the descriptors is determined by obtaining the bounds for the topological indices of graphs. In this paper, firstly, some upper bounds for the Y -index on trees with several types of domination number are studied. Secondly, some new bounds are also presented for this index of graphs in terms of relevant parameters with other topological indices. Additionally, a new idea on bounds for the Y -index by applying binary graph operations is computed.
ACM Computing Classification System: MathematicsofComputing_GENERAL
General Mathematics, Mathematics, QA1-939, Article Subject
General Mathematics, Mathematics, QA1-939, Article Subject
ACM Computing Classification System: MathematicsofComputing_GENERAL
In mathematical chemistry, the topological indices with highly correlation factor play a leading role specifically for developing crucial information in QSPR/QSAR analysis. Recently, there exists a new graph invariant, namely, Y -index of graph proposed by Alameri as the sum of the fourth power of each and every vertex degree of that graph. The approximate range of the descriptors is determined by obtaining the bounds for the topological indices of graphs. In this paper, firstly, some upper bounds for the Y -index on trees with several types of domination number are studied. Secondly, some new bounds are also presented for this index of graphs in terms of relevant parameters with other topological indices. Additionally, a new idea on bounds for the Y -index by applying binary graph operations is computed.