A NOTE ON THE LONGEST CYCLES IN 2-CONNECTED GRAPHS

您当前的位置：

首页 >

文章列表页 >

更新时间：2026-09-14

- A NOTE ON THE LONGEST CYCLES IN 2-CONNECTED GRAPHS
- 关于2-连通图中最长圈的一个注记
- Issue 4, (1994)
- 作者机构：
  
  中科院系统所
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：1994
- 稿件说明：
移动端阅览
卫兵. A NOTE ON THE LONGEST CYCLES IN 2-CONNECTED GRAPHS[J]. 1994, (4).
DOI：

卫兵. A NOTE ON THE LONGEST CYCLES IN 2-CONNECTED GRAPHS[J]. 1994, (4). DOI：

设Ｇ是一个ｎ阶２－连通图，ｍ＞０是一个整数．本文证明了：如果对于图Ｇ中任意三点独立集Ｓ＝｛ｕ，ｖ，ｗ｝｝，都存在ｘ≠ｙ∈Ｓ使得ｄ（ｘ）＋ｄ（ｙ）≥ｍ，则ｃ（Ｇ）≥ｍｉｎ｛ｎ，ｍ｝．其中ｃ（Ｇ）表示图Ｇ的周长．这个结果推广了三个有关的已知结果。

Let G be a 2-connected graph on n vertices and m＞0 be an integer．In this paper，we show that if for any independent set S＝｛u

w｝of G， there exist x≠y∈S　such that d（x）＋d（y），then min｛n

m｝ where c（G）is the circumference of G. This generalizes three related results known before.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A FAN TYPE CONDITION FOR HAMILTONIAN CONNECTED GRAPHS

《中北大学学报(自然科学版》》征稿简则

Study on the Removal of CO2 in Confined Space by High⁃Gravity Enhanced Potassium Hydroxide Coupled Potassium Glycinate Solution

Research Progress on Machine Learning⁃Based Structural Design and Performance Characterization of Composites

Related Author

白艳萍

柳林

郭振海

Related Institution

华北工学院

⁰