期刊文献+

THE MAXIMUM GENUS OF A 3-REGULAR SIMPLICIAL GRAPH

THE MAXIMUM GENUS OF A 3 REGULAR SIMPLICIAL GRAPH
下载PDF
导出
摘要 Abstract In this paper, the relationship between non separating independent number and the maximum genus of a 3 regular simplicial graph is presented. A lower bound on the maximum genus of a 3 regular graph involving girth is provided. The lower bound is tight, it improves a bound of Huang and Liu. Abstract In this paper, the relationship between non separating independent number and the maximum genus of a 3 regular simplicial graph is presented. A lower bound on the maximum genus of a 3 regular graph involving girth is provided. The lower bound is tight, it improves a bound of Huang and Liu.
机构地区 Dept.ofMath. Dept
出处 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 1999年第2期203-214,共12页 高校应用数学学报(英文版)(B辑)
关键词 1991 MR Subject Classification 05C10 1991 MR Subject Classification 05C10
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部