安徽大学学报（自然科学版）2012，Vol.36Issue(6)：11-15,5.
简单图的支配数和上可嵌入性
Domination number and upper embeddability of a simple graph
摘要
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.关键词
支配数/最大亏格/上可嵌入性/顶点度和/亏格Key words
domination number/ maximum genus/ upper embeddability/ degree sum/ deficiency分类
数理科学引用本文复制引用
王涛,李德明..简单图的支配数和上可嵌入性[J].安徽大学学报（自然科学版）,2012,36(6):11-15,5.基金项目
Supported by National Natural Science Foundation of China (10201022,10971144),the Natural Science Foundation of Beijing City(1102015) and the Fundamental Research Funds for the Central Universities(2011B019) （10201022,10971144）
