The Maximum Genus of a Graph and the Number of Cut Vertexes

Liu Duan-feng; HUANG Yuan-qiu

English Version Journal Login

您当前的位置：

首页 >

文章列表页 >

The Maximum Genus of a Graph and the Number of Cut Vertexes

更新时间：2026-05-27

- The Maximum Genus of a Graph and the Number of Cut Vertexes
- Vol. 22, Issue 3, Pages: 121-124(2005)
- 作者机构：
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Online First：02 July 2005，
  
  Published：2005
- 稿件说明：
移动端阅览
刘端凤, 黄元秋. 图的最大亏格与割点数[J]. 广东工业大学学报, 2005, 22(3): 121-124.

Liu Duan-feng, HUANG Yuan-qiu. The Maximum Genus of a Graph and the Number of Cut Vertexes[J]. 2005, 22(3): 121-124.
刘端凤, 黄元秋. 图的最大亏格与割点数[J]. 广东工业大学学报, 2005, 22(3): 121-124. DOI：

Liu Duan-feng, HUANG Yuan-qiu. The Maximum Genus of a Graph and the Number of Cut Vertexes[J]. 2005, 22(3): 121-124. DOI：

摘要

关于图的最大亏格的研究

通常都是结合图的一些不变量

如连通性、直径、围长、点的度等.本文联系着图的割点数

研究图的最大亏格下界

得到了一些新的结果.

Abstract

Studies about the maximum gemus of a graph are usually based on some invariariable parameters

such as connectivity

diameter

the degree of vertexes.In contact with the number of cut vertexes of a graph

this paper studies the lower boundary of maximum genus and receives some new results.

关键词

Keywords

references

黄元秋,刘彦佩. 关于点的度在modulo4下等值的上可嵌入图类[J]. 数学物理学报. 2000(02)

黄元秋,刘彦佩. 关于图的最大亏格的一个定理改进[J]. 应用数学. 1998(02)

刘彦佩著.图的可嵌入性理论[M]. 科学出版社, 1994

Huang Yuanqiu,Liu Yanpei. Maximum genus, independence number and girth[J], 2000

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Research on Foreign Object Detection in Power Transmission Lines Based on the AAGV-YOLOX Model

SCA-YOLO: Real-time Target Detection Based on Deformable Convolution and Context-aware Attention

Bimodal Iterative Cross-attention Fusion Ensemble Framework

Multi-Scale Contrastive Embedding Enhanced Adaptive Intrusion Detection Model

An Optimal Operation Strategy for Community Microgrid Alliances Considering Power Exchange under Multi-package Shared Energy Storage Model

Related Author

No data

Related Institution

No data

AI问答

⁰