Further study on k-restricted edge connectivity and exact k-restricted edge connectivity of a graph

Author:

Chandran Athira1ORCID,John Roy2ORCID,Suresh Singh G.1ORCID

Affiliation:

1. Department of Mathematics, University of Kerala, Thiruvananthapuram, Kerala, India

2. Department of Mathematics, St. Stephen’s College, Pathanapuram, Kerala, India

Abstract

Inspired by the studies on conditional connectivity by Harary [1], we worked on [Formula: see text]-restricted edge connectivity of a graph [Formula: see text] [4]. The [Formula: see text]-restricted edge connectivity of a graph [Formula: see text] is the cardinality of a minimum edge-cut whose deletion disconnects the graph [Formula: see text] into components where each component has order at least [Formula: see text]. In this work, we take into account some results on [Formula: see text]-restricted edge connectivity and the novel parameter exact [Formula: see text]-restricted edge connectivity. In the definition of [Formula: see text]-restricted edge connectivity, we impose some extra constraints to achieve this parameter. In this paper, we consider some fundamental aspects of exact [Formula: see text]-restricted edge connectivity and how they relate to the [Formula: see text]-restricted edge connectivity.

Funder

University Grants Commission

Publisher

World Scientific Pub Co Pte Ltd

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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