Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem

Author:

Shook James M.1ORCID

Affiliation:

1. Computer Security Division National Institute of Standards and Technology Gaithersburg Maryland USA

Abstract

AbstractA simple graph with edge‐connectivity and minimum degree is maximally edge‐connected if . In 1964, given a nonincreasing degree sequence , Jack Edmonds showed that there is a realization of that is ‐edge‐connected if and only if with when . We strengthen Edmonds's result by showing that given a realization of if is a spanning subgraph of with such that when , then there is a maximally edge‐connected realization of with as a subgraph. Our theorem tells us that there is a maximally edge‐connected realization of that differs from by at most edges. For , if has a spanning forest with components, then our theorem says there is a maximally edge‐connected realization that differs from by at most edges. As an application we combine our work with Kundu's ‐factor theorem to show there is a maximally edge‐connected realization with a ‐factor for and present a partial result to a conjecture that strengthens the regular case of Kundu's ‐factor theorem.

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Reference23 articles.

1. C.Berge The theory of graphs and its applications Methuen & CO LTD London;John Wiley & SONS INC New York 1962.

2. On graphs with equal edge connectivity and minimum degree

3. Regular factors of regular graphs

4. Packing of graphic n-tuples

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3