On the Toughness of a Graph（Ⅰ）

Xu Jin

您当前的位置：

首页 >

文章列表页 >

On the Toughness of a Graph（Ⅰ）

更新时间：2025-12-08

- On the Toughness of a Graph（Ⅰ）
- Acta Electronica Sinica Issue 1, (1996)
- 作者机构：
  
  西安电子科技大学电子工程研究所
- 作者简介：
- 基金信息：
- DOI：
  CLC： TN711.6
- Published：1996
- 稿件说明：
移动端阅览
[1]许进.论图的坚韧度（Ⅰ）──基本理论[J].电子学报,1996(01):23-27.

Xu Jin. On the Toughness of a Graph（Ⅰ）[J]. Acta Electronica Sinica, 1996, (1).
[1]许进.论图的坚韧度（Ⅰ）──基本理论[J].电子学报,1996(01):23-27. DOI：

Xu Jin. On the Toughness of a Graph（Ⅰ）[J]. Acta Electronica Sinica, 1996, (1). DOI：

摘要

本文首先指出坚韧度τ（Ｇ）是可以用来刻划图的连通性，因而能广泛地应用于通讯网络可靠性等有关领域的研究。进而，研究了坚韧度的自身特性，诸如取值范围、存在性问题、计数问题以及计算问题等。

Abstract

In this paper

it is proved that τ （G） can be sued to describe the connectivity of a graph.The properties of the toughness of a graph

such as the range of value

enumeration

computing

Are studied.

关键词

Keywords

references

Views

194

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Connected Coverage Protocol Using Cooperative Sensing Model for Wireless Sensor Networks

On Biconnectivity for One-Dimensional Wireless Ad Hoc Networks

An Adaptive Routing Method for High-Speed-Road Scenario of the Internet of Vehicle

Related Author

MENG Fan-zhi

WANG Huan-zhao

HE Hui

TIAN Ye

SHENG Min

LI Jian-dong

DUAN Peng

ZHANG De-gan

Related Institution

Department of Computer Science and Technology,Xi’an Jiaotong University

State Key Laboratory of Integrated Service Networks,Information Science Institute,Xidian University

School of Electronics Information,Northwestern Polytechnical University

State Key Laboratory of Integrated Service NetworksInformation Science InstituteXidian UniversityXi’anShaanxi 710071China

School of Electronics InformationNorthwestern Polytechnical UniversityXi’anShaanxi 710072China

⁰