On the Extremal Values of the Weighted Integrity of a Graph

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":"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}
引用次数: 0

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
图的加权完整性极值问题
图[公式:见文]的完整性定义为[公式:见文]占所有[公式:见文]的最小值,其中[公式:见文]表示图[公式:见文]的一个分量的最大基数。在本文中,我们研究了该参数的加权版本的最大值和最小值的界。对于相关参数顶点邻居完整性,我们也考虑了同样的问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
JOURNAL OF INTERCONNECTION NETWORKS
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.
期刊最新文献
On the Local Metric Dimension of Graphs Bounds of Two Toughnesses and Binding Numbers for Star Factors Some Existence Theorems on Star Factors Krill Herd and Feed Forward Optimization System-Based Routing Protocol for IoT-MANET Environment Embedding Knödel Graph into Cube-like Architectures: Dilation Optimization and Wirelength Analysis
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1