Abstract
Abstract For some a and b positive rational numbers, a simple graph with n vertices and m = a n − b edges is an ( a , b ) -linear graph, when n > 2 b . We characterize non-empty classes of ( a , b ) -linear graphs and determine those which contain connected graphs. For non-empty classes, we build sequences of ( a , b ) -linear graphs and sequences of connected ( a , b ) -linear graphs. Furthermore, for each of these sequences where every graph is bounded by a constant, we show that its correspondent sequence of diameters diverges, while its correspondent sequence of algebraic connectivities converges to zero.
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.
