An extremal problem on the connectivity of graphs

descriptionPublicationkeyboard_double_arrow_right Article 01 Jun 1984 English Publisher:WileyJournal:Networks, volume 14, pages 337-354 (issn: 0028-3045, eissn: 1097-0037,

Copyright policy )

Authors: Qi-Mei He;

doi: 10.1002/net.3230140210

An extremal problem on the connectivity of graphs

- Summary
- Subjects
- Metrics

Abstract

AbstractWe solve in this paper a problem proposed by Bi‐weng Zhu at the First Combinatorics and Graph Theory Conference of China. For the minimum degree δ, connectivity k, and line‐connectivity λ of a (p,q) graph, p,q fixed, the maximum values of δ ‐ k, δ ‐ λ, and λ ‐ k are given as well as extremal graphs for which these upper bounds are realized.

Related Organizations

Instytut Kolejnictwa
Poland

Keywords

Extremal problems in graph theory, Connectivity, minimal degree, vertex connectivity, edge connectivity

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	3
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average