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

On super 3-restricted edge connectivity of regular strong product graphs with girth at least four

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

3 Author(s)
Yingying Qin ; Dept. of Math. & Phys., Wuyi Univ., Jiangmen, China ; Zhiping Xiong ; Jingyu Wang

It is known that communication networks with topologies being super 3-restricted edge connected graphs are more reliable under some reasonable conditions. Let Gi be maximally edge connected ki - regular graphs with k i≥ 3, i = 1,2 . It is proved in this work that if g(Gi) ≥ 4 , then the strong product G1⊗G2 of graphs G1 and G2 is super 3 -restricted edge connected.

Published in:

Networking and Digital Society (ICNDS), 2010 2nd International Conference on  (Volume:1 )

Date of Conference:

30-31 May 2010

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.