给定控制数的连通二部图的最大边数

J4 ›› 2012, Vol. 47 ›› Issue (8): 11-15.

给定控制数的连通二部图的最大边数

陈宏宇^1,2, 张丽³

1. 上海应用技术学院理学院,上海 201418; 2. 山东大学数学学院, 山东济南 250100;
3. 上海金融学院应用数学系,上海 201209

收稿日期:2011-11-18 出版日期:2012-08-20 发布日期:2012-12-24
作者简介:陈宏宇(1981- ),女,博士,讲师,主要研究方向为图论与组合最优化. Email: hongyuchen86@163.com
基金资助:
上海应用技术学院引进人才科研启动项目(YJ201220)

Maximum number of edges in connected bipartite graphs with a given domination number

CHEN Hong-yu1,2, ZHANG Li3

1. School of Sciences, Shanghai Institute of Technology, Shanghai 201418, China;
2. School of Mathematics, Shandong University, Jinan 250100, Shandong, China;
3. Department of Applied Mathematics, Shanghai Finance University, Shanghai 201209, China

Received:2011-11-18 Online:2012-08-20 Published:2012-12-24

摘要/Abstract

摘要：

研究了n个顶点的连通二部图当控制数γ(G)≥3,最大度Δ(G)≥n-γ(G)-1时的最大边数。

关键词: 控制集;控制数; 连通二部图

Abstract:

The maximum number of edges that a connected bipartite graph with n vertices, domination number γ(G)≥3, and the maximum degree Δ(G)≥n-γ(G)-1 is studied.

Key words: dominating set; domination number; connected bipartite graph

陈宏宇1,2, 张丽3. 给定控制数的连通二部图的最大边数[J]. J4, 2012, 47(8): 11-15.

CHEN Hong-yu1,2, ZHANG Li3. Maximum number of edges in connected bipartite graphs with a given domination number[J]. J4, 2012, 47(8): 11-15.

参考文献

多维度评价

Viewed

Full text

Abstract

Cited

Shared

Discussed