Cart (Loading....) | Create Account
Close category search window

Graphs with given connectivity and independence number or networks with given measures of vulnerability and survivability

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

The criterion for invulnerability of a network based on the connectivity of a graph is well treated in literature. We define a criterion for survivability of a network in terms of the independence number of a graph. The following problems are then considered. 1) Find anr-connected graph, withnvertices andm_0 = [(nr + l)/2]edges, whose independence number is the minimum possible, where[x]denotes the greatest integer less than or equal tox cdot 2) Given positive integersn,m,r, andk, find the realizability conditions for a graph withnvertices andmedges, whose connectivity is at leastrand independence number is at mostk.

Published in:

Circuit Theory, IEEE Transactions on  (Volume:20 ,  Issue: 1 )

Date of Publication:

Jan 1973

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.