引用本文
  • 潘玉美.无三边形极小3连通图的非基本边数[J].广西科学,2008,15(3):231-232.    [点击复制]
  • PAN Yu-mei.The Number of Non-essential Edges in Triangle-free Minimally 3-Connected Graphs[J].Guangxi Sciences,2008,15(3):231-232.   [点击复制]
【打印本页】 【在线阅读全文】【下载PDF全文】 查看/发表评论下载PDF阅读器关闭

←前一篇|后一篇→

过刊浏览    高级检索

本文已被:浏览 314次   下载 340 本文二维码信息
码上扫一扫!
无三边形极小3连通图的非基本边数
潘玉美
0
(柳州师范高等专科学校数学与计算机科学系, 广西柳州 545004)
摘要:
给出无三边形极小3连通图G的非基本边数的下界︱G︱+3,并证明图G的非基本边数达到下界当且仅当G同构于K3,3.
关键词:  连通图  无三边形  非基本边
DOI:
投稿时间:2007-09-10
基金项目:
The Number of Non-essential Edges in Triangle-free Minimally 3-Connected Graphs
PAN Yu-mei
(Department of Mathematics and Computer Science, Liuzhou Teachers College, Liuzhou, Guangxi, 545004, China)
Abstract:
A lower for the number of non-essential edges of the triangle-free minimally 3-connected graph and the characterization of the graph that reach the lower bound are given.
Key words:  connected graph  triangle-free  non-essential edge

用微信扫一扫

用微信扫一扫