图的加权完整性极值问题

IF 0.5 Q4 COMPUTER SCIENCE, THEORY & METHODS

JOURNAL OF INTERCONNECTION NETWORKS Pub Date : 2023-09-26 DOI:10.1142/s0219265923500196

Wayne Goddard, Julia VanLandingham

{"title":"图的加权完整性极值问题","authors":"Wayne Goddard, Julia VanLandingham","doi":"10.1142/s0219265923500196","DOIUrl":null,"url":null,"abstract":"The integrity of a graph [Formula: see text] is defined as the minimum value of [Formula: see text] taken over all [Formula: see text], where [Formula: see text] denotes the maximum cardinality of a component of graph [Formula: see text]. In this paper, we investigate bounds on the maximum and minimum values of the weighted version of this parameter. We also consider the same question for the related parameter vertex-neighbor-integrity.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"6 1","pages":"0"},"PeriodicalIF":0.5000,"publicationDate":"2023-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Extremal Values of the Weighted Integrity of a Graph\",\"authors\":\"Wayne Goddard, Julia VanLandingham\",\"doi\":\"10.1142/s0219265923500196\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The integrity of a graph [Formula: see text] is defined as the minimum value of [Formula: see text] taken over all [Formula: see text], where [Formula: see text] denotes the maximum cardinality of a component of graph [Formula: see text]. In this paper, we investigate bounds on the maximum and minimum values of the weighted version of this parameter. We also consider the same question for the related parameter vertex-neighbor-integrity.\",\"PeriodicalId\":53990,\"journal\":{\"name\":\"JOURNAL OF INTERCONNECTION NETWORKS\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2023-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"JOURNAL OF INTERCONNECTION NETWORKS\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s0219265923500196\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"JOURNAL OF INTERCONNECTION NETWORKS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0219265923500196","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

图[公式:见文]的完整性定义为[公式:见文]占所有[公式:见文]的最小值，其中[公式:见文]表示图[公式:见文]的一个分量的最大基数。在本文中，我们研究了该参数的加权版本的最大值和最小值的界。对于相关参数顶点邻居完整性，我们也考虑了同样的问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the Extremal Values of the Weighted Integrity of a Graph

The integrity of a graph [Formula: see text] is defined as the minimum value of [Formula: see text] taken over all [Formula: see text], where [Formula: see text] denotes the maximum cardinality of a component of graph [Formula: see text]. In this paper, we investigate bounds on the maximum and minimum values of the weighted version of this parameter. We also consider the same question for the related parameter vertex-neighbor-integrity.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

JOURNAL OF INTERCONNECTION NETWORKS COMPUTER SCIENCE, THEORY & METHODS-

自引率

14.30%

发文量

121

期刊介绍： The Journal of Interconnection Networks (JOIN) is an international scientific journal dedicated to advancing the state-of-the-art of interconnection networks. The journal addresses all aspects of interconnection networks including their theory, analysis, design, implementation and application, and corresponding issues of communication, computing and function arising from (or applied to) a variety of multifaceted networks. Interconnection problems occur at different levels in the hardware and software design of communicating entities in integrated circuits, multiprocessors, multicomputers, and communication networks as diverse as telephone systems, cable network systems, computer networks, mobile communication networks, satellite network systems, the Internet and biological systems.