Abstract

Sanskruti index of a graph [Formula: see text] with vertex-set [Formula: see text] and edge-set [Formula: see text] is [Formula: see text], where [Formula: see text]. In this paper, the extremal graphs in the class of unicyclic graphs are characterized with respect to the Sanskruti index, where the considered class of unicyclic graphs contains five different large families of graphs.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call