Lower and upper bounds on graph communicabilities

IF 0.7 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters Pub Date : 2024-05-08 DOI:10.1016/j.ipl.2024.106501

Amir Hossein Ghodrati , Mohammad Ali Hosseinzadeh

引用次数: 0

Abstract

In this paper, some lower and upper bounds for the subgraph centrality and communicability of a graph are proved. The expected value of the normalized total communicability of a random $G (n, p)$ graph is also considered and asymptotically determined. Moreover, some computational results are presented to compare the bounds obtained in this paper with some other bounds in the literature.

查看原文本刊更多论文

图通信能力的下限和上限

本文证明了图的子图中心性和可传播性的一些下限和上限。本文还考虑了随机 G(n,p) 图的归一化总可传播性的期望值，并对其进行了渐近确定。此外，本文还给出了一些计算结果，将本文得到的界限与文献中的其他一些界限进行了比较。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Information Processing Letters 工程技术-计算机：信息系统

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

7.3 months

期刊介绍： Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.