Edge-Tenacity in Graphs
Received:August 26, 2002  
Key Words: edge cut-sets   strictly edge-tenacious graph   K-trees   higher-order edge toughness   edge toughness.  
Fund Project:Supported by the Ministry of Communication (200332922505) and the Doctoral Foundation of Ministry of Education (20030151005)
Author NameAffiliation
WANG Zhi-ping Dept. of Math. & Phys.
Dalian Maritime University
Dalian
China 
REN Guang Inst. of Marine Engineering
Dalian Maritime University
Dalian
China 
ZHAO Lian-chang Dept. of Math. & Phys.
Dalian Maritime University
Dalian
China 
Hits: 3280
Download times: 1553
Abstract:
      
Citation:
DOI:10.3770/j.issn:1000-341X.2004.03.005
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.