Abstract
Proving interrelations between structural graph measures analytically has been intricate. Generally, relations between structural graph measures describe the interplay between measures which turned out to be useful for better understanding the properties of such quantities. The results which have been achieved so far are restricted to simple measures or special graph classes such as trees. In this paper, we introduce a probabilistic approach for establishing inequalities between quantitative network measures on random networks. Those inequalities between different graph measures lead to a deeper understanding of the mathematical apparatus and, in particular, to a discussion of quality aspects of structural graph measures, which is a major contribution of this paper.
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 callDisclaimer: 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.
