Planar graph characterization of NDSS graphs
[摘要] Planar graph characterization is always of interest due to its complexity in characterization. In this paper, we obtain a necessary and sufficient condition for a graph to be NDSS and hence characterize the planarity and outer - planarity of its complement G.
[发布日期] [发布机构] Department of Mathematics, School of Advanced Sciences, VIT University, Vellore; 632014, India^1
[效力级别] 工业技术 [学科分类]
[关键词] Planar graph;Planarity [时效性]