| 简单图的支配数和上可嵌入性(英文) |
| |
| 引用本文： | 王涛,李德明. 简单图的支配数和上可嵌入性(英文)[J]. 安徽大学学报(自然科学版), 2012, 0(6): 11-15 |
| |
| 作者姓名： | 王涛 李德明 |
| |
| 作者单位： | 华北科技学院基础部;首都师范大学数学系 |
| |
| 基金项目： | Supported by National Natural Science Foundation of China(10201022,10971144);the Natural Science Foundation of Beijing City(1102015);the Fundamental Research Funds for the Central Universities(2011B019) |
| |
| 摘 要： | 设图G是n阶简单连通图.如果G的支配数为1,则G是上可嵌入的.如果G是2-边连通且G的支配数为2,则G是上可嵌入的.如果G是3-边连通且G的支配数为3,则G的最大亏格介于|(β(G)-2)/2|和|β(G)/2|之间,其中β(G)=|E(G)|-|V(G)|+1.论文得到了一些在控制数和边连通度条件下的最大亏格的界.
|
| 关 键 词： | 支配数 最大亏格 上可嵌入性 顶点度和 亏格 |
Domination number and upper embeddability of a simple graph |
| |
| WANG Tao,LI De-ming. Domination number and upper embeddability of a simple graph[J]. Journal of Anhui University(Natural Sciences), 2012, 0(6): 11-15 |
| |
| Authors: | WANG Tao LI De-ming |
| |
| Affiliation: | 1.Department of Basic Course,North China Institute of Science and Technology,Sanhe 065201,China;2.Department of Mathematics,Capital Normal University,Beijing 100048,China) |
| |
| Abstract: | Let G be a connected simple graph of order n.If the domination number of G was 1,G was upper embeddable.If G was 2-edge connected,and the domination number of G was 2,G was upper embeddable.If G was 3-edge connected,and the domination number of G was 3,the maximum genus of G was |(β(G)-2)/2|≤gM(G)≤|β(G)/2|,where β(G)=|E(G)|-|V(G)|+1.And we got some other results on the bound of the maximum genus of a graph with constraints of domination number and edge connectivity. |
| |
| Keywords: | domination number maximum genus upper embeddability degree sum deficiency |
| 本文献已被 CNKI 等数据库收录！ |
|
