
You have already added 0 works in your ORCID record related to the merged Research product.
You have already added 0 works in your ORCID record related to the merged Research product.
<script type="text/javascript">
<!--
document.write('<div id="oa_widget"></div>');
document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=undefined&type=result"></script>');
-->
</script>
You have already added 0 works in your ORCID record related to the merged Research product.
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

doi: 10.1155/2022/4346234
Some New Upper Bounds for the Y-Index of Graphs
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
Article Subject, General Mathematics, Mathematics, QA1-939
Article Subject, General Mathematics, Mathematics, QA1-939
ACM Computing Classification System: MathematicsofComputing_GENERAL
13 Research products, page 1 of 2
- 2021IsAmongTopNSimilarDocuments
- 2022IsAmongTopNSimilarDocuments
- 2014IsAmongTopNSimilarDocuments
- 2020IsAmongTopNSimilarDocuments
- 2021IsAmongTopNSimilarDocuments
- 2019IsAmongTopNSimilarDocuments
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).4 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).4 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average Powered byBIP!

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.