A FAN TYPE CONDITION FOR HAMILTONIAN CONNECTED GRAPHS

柳林; 郭振海

您当前的位置：

首页 >

文章列表页 >

A FAN TYPE CONDITION FOR HAMILTONIAN CONNECTED GRAPHS

更新时间：2026-09-14

- A FAN TYPE CONDITION FOR HAMILTONIAN CONNECTED GRAPHS
- Hamilton连通图的一个Fan型条件
- Issue 2, Pages: 110-112(1993)
- 作者机构：
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：1993
- 稿件说明：
移动端阅览
柳林, 郭振海. A FAN TYPE CONDITION FOR HAMILTONIAN CONNECTED GRAPHS[J]. 1993, (2): 110-112.
DOI：

柳林, 郭振海. A FAN TYPE CONDITION FOR HAMILTONIAN CONNECTED GRAPHS[J]. 1993, (2): 110-112. DOI：

摘要

设G是一个n阶3-连通图

本文证明了:若对G中任意两个不相邻的顶点u和v使得1≤|N(u)∩N(v)|≤α

蕴含max{d(u)

d(v)}≥(n+1)/2

则G是Hamilton连通的。

Abstract

Let G be a 3-connected graph of order n. This paper proves that if for any two nonadjacent vertices u and v

1≤|N(u)∩N(v)|≤α

implies max{d(u)

d(v)}≥1/2(n+ 1)

then G is Hamiltonian connected graph.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A FAN TYPE CONDITION FOR HAMILTONIAN CONNECTED GRAPHS

A NOTE ON THE LONGEST CYCLES IN 2-CONNECTED GRAPHS

NEIGHBORHOOD UNIONS AND HAMILTON-CONNECTEDNESS OF GRAPHS

PEG⁃Like Polymers Based on Low Molecular Weight PEI as Gene Vectors

Network Intrusion Detection Model Based on Recurrence Plot and MobileViT⁃AESTF

Related Author

白艳萍

卫兵

储茂权

丁立风

Related Institution

华北工学院

中科院系统所

⁰