On the general Z -type index of connected graphs
Discrete Optimization, ISSN: 1572-5286, Vol: 50, Page: 100808
2023
- 2Citations
Metric Options: Counts1 Year3 YearSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Metrics Details
- Citations2
- Citation Indexes2
Article Description
Let G=(V,E) be a connected graph, and d(u) the degree of vertex u∈V. We define the general Z -type index of G as Zα,β(G)=∑uv∈E[d(u)+d(v)−β]α, where α and β are two real numbers. This generalizes several famous topological indices, such as the first and second Zagreb indices, the general sum-connectivity index, the reformulated first Zagreb index, and the general Platt index, which have successful applications in QSPR/QSAR research. Hence, we are able to study these indices in a unified approach. Let C(π) the set of connected graphs with degree sequence π. In the present paper, under different conditions of α and β, we show that: (1) There exists a so-called BFS-graph having extremal Zα,β index in C(π) ; (2) If π is the degree sequence of a tree, a unicyclic graph, or a bicyclic graph, with minimum degree 1, then there exists a special BFS-graph with extremal Zα,β index in C(π) ; (3) The so-called majorization theorem of Zα,β holds for trees, unicyclic graphs, and bicyclic graphs. As applications of the above results, we determine the extremal graphs with maximum Zα,β index for α>1 and β≤2 in the set of trees, unicyclic graphs, and bicyclic graphs with given number of pendent vertices, maximum degree, independence number, matching number, and domination number, respectively. These extend the main results of some published papers.
Bibliographic Details
http://www.sciencedirect.com/science/article/pii/S1572528623000506; http://dx.doi.org/10.1016/j.disopt.2023.100808; http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=85173251486&origin=inward; https://linkinghub.elsevier.com/retrieve/pii/S1572528623000506; https://dx.doi.org/10.1016/j.disopt.2023.100808
Elsevier BV
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know