典型文献
Nonseparating Independent Sets and Maximum Genus of Graphs
文献摘要：
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-I is connected.Let Z(G)denote the cardinality of a maximum NSIS of G.A nonseparating independent set containing Z(G)vertices is called the maximum nonseparating independent set.In this paper,we firstly give an upper bound for Z(G)of regular graphs and determine Z(G)for some types of circular graphs.Secondly,we show a relationship between Z(G)and the maximum genusγM(G)of a general graph.Finally,an important formula is provided to compute Z(G),i.e.,Z(G)=∑ dI(x)+2(γM(G-I)-γM(G))+(ζ(G-I)-ζ(G)),x∈I where I is the maximum nonseparating independent set and ζ(G)is the Betti deficiency(Xuong,1979)of G.
文献关键词：
中图分类号：
作者姓名：
Chao YANG;Han REN;Er-ling WEI
作者机构：
Center of Intelligent Computing and Applied Statistics,School of Mathematics,Physics and Statistics,Shanghai University of Engineering Science,Shanghai 201620,China;School of Mathematical Sciences,East China Normal University,Shanghai 200241,China;Shanghai Key Laboratory of PMMP,Shanghai 200241,China
文献出处：
引用格式：
[1]Chao YANG;Han REN;Er-ling WEI-.Nonseparating Independent Sets and Maximum Genus of Graphs)[J].应用数学学报（英文版）,2022(03):719-728
A类：
Nonseparating,nonseparating,NSIS,dI,Betti,Xuong
B类：
Independent,Sets,Maximum,Genus,Graphs,subset,vertices,undirected,connected,independent,if,two,are,adjacent,Let,denote,cardinality,maximum,containing,called,this,paper,firstly,give,upper,bound,regular,graphs,determine,some,types,circular,Secondly,show,relationship,between,genus,general,Finally,important,formula,provided,compute,+2,where,deficiency
AB值：
0.474023
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
