Abstract
This paper gives some bounds for the vertex degree function index Hf(G) in terms of the order and size of a graph G, where G is a simple, finite and connected graph with minimum degree δ and maximum degree ∆. Some families of graphs are also constructed to show that the bounds can be achieved.
Sign-in/Register to access full text options 
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 callMore From: Match Communications in Mathematical and in Computer Chemistry
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
