首页 | 本学科首页   官方微博 | 高级检索  
     


Nonseparating Independent Sets and Maximum Genus of Graphs
Authors:Yang  Chao  Ren  Han  Wei  Er-ling
Affiliation:1.Center of Intelligent Computing and Applied Statistics, School of Mathematics, Physics and Statistics, Shanghai University of Engineering Science, Shanghai, 201620, China
;2.School of Mathematical Sciences, East China Normal University, Shanghai, 200241, China
;3.Shanghai Key Laboratory of PMMP, Shanghai, 200241, China
;4.School of Mathematics, Renmin University of China, Beijing, 100872, China
;
Abstract:Acta Mathematicae Applicatae Sinica, English Series - A subset I of vertices of an undirected connected graph G is a nonseparating independent set (NSIS) if no two vertices of I are adjacent and G...
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号