World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

VERTEX VULNERABILITY PARAMETER OF GEAR GRAPHS

    https://doi.org/10.1142/S0129054111008635Cited by:12 (Source: Crossref)

    For a vertex v of a graph G = (V,E), the independent domination number (also called the lower independence number) iv(G) of G relative to v is the minimum cardinality of a maximal independent set in G that contains v. The average lower independence number of G is . In this paper, this parameter is defined and examined, also the average lower independence number of gear graphs is considered. Then, an algorithm for the average lower independence number of any graph is offered.

    Remember to check out the Most Cited Articles!

    Check out these Handbooks in Computer Science