Abstract
The zeroth-order general Randić index of a digraph is the sum of over all arcs of , where , and are an arbitrary real number, the out-degree of the vertex and the in-degree of the vertex , respectively. We determine maximum zeroth-order general Randić index of oriented trees, unicyclic and bicyclic graphs in terms of matching number and order in this paper.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.