A Local Condition for Dominating Cycles in Graphs with Large Girth

Lou Ding jun

您当前的位置：

首页 >

文章列表页 >

A Local Condition for Dominating Cycles in Graphs with Large Girth

更新时间：2023-12-11

- A Local Condition for Dominating Cycles in Graphs with Large Girth
- Acta Scientiarum Naturalium Universitatis SunYatseni Vol. 35, Issue 2, Pages: 6-9(1996)
- 作者机构：
  
  中山大学计算机科学系
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：1996，
  
  Published Online：25 February 1996，
扫描看全文
Lou Ding jun. A Local Condition for Dominating Cycles in Graphs with Large Girth. [J]. Acta Scientiarum Naturalium Universitatis SunYatseni 35(2):6-9(1996)
DOI：

Lou Ding jun. A Local Condition for Dominating Cycles in Graphs with Large Girth. [J]. Acta Scientiarum Naturalium Universitatis SunYatseni 35(2):6-9(1996) DOI：

摘要

设Ｇ是围长大于或等于５的连通图．本文证明了；如果对Ｇ中每个顶点ｖ，距离ｖ为２和３的顶点导出的子图的独立数不大于最小度的两倍减３，那么Ｇ中有控制圈．

Abstract

For a connected graph G with girth of least five

it is proved in this paper that if

for each vertex v of G

the independence numbor of the subgraph reduced by the venices that are of distance two or three from v is not greater than two times the minimum degree minus three

then G has a dominating cycle.

关键词

控制圈局部条件最小度数独立数

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A Local Degree Condition for Hamiltonian Bipartite Graphs

Related Author

Lou Dingjun

Related Institution

Department of Computer Science,Zhongshan University

Postal code：510275
Tel：020-84112585，84113223 Email：xuebaozr@mail.sysu.edu.cn
Technical support is provided by Beijing Founder electronics co., LTD 京ICP备09064830号-19 京公网安备11010802024621
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.

⁰