Connectivity of Circulant Graphs
Received:September 02, 1996  Revised:January 05, 1998
Key Words: circulant graph   connectivity   atomic part  
Fund Project:
Author NameAffiliation
LI Tang-fen Southwest information Centre
State Science and Technology Commission of China
Chongqing 400013 
Hits: 1899
Download times: 820
Abstract:
      In this paper, an explicit expression is derived for the connectivity of a connected circulant graph whose connectivity is less than its point degree, that is κ(G)=min{m|M(n/m,K)|:m is a proper divisor of n and |M(n/m,K)|
Citation:
DOI:10.3770/j.issn:1000-341X.1999.03.024
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.