Monitoring Edge-Geodetic Numbers of Mycielskian Graph Classes

IF 0.5 Q4 COMPUTER SCIENCE, THEORY & METHODS

JOURNAL OF INTERCONNECTION NETWORKS Pub Date : 2024-05-23 DOI:10.1142/s0219265924500105

Xin Li, Wen Li, Ao Tan, Mengmeng He, Weizhen Chen

引用次数: 0

Abstract

Let [Formula: see text] be a graph and [Formula: see text] be the vertex set of [Formula: see text]. If any edge appears in the unique shortest path of at least one vertex pair in set [Formula: see text], then [Formula: see text] is defined as the monitoring edge-geodetic set (MEG-set for short). We denote by [Formula: see text] the size of a smallest MEG-set of [Formula: see text]. In this paper, we studied the monitoring edge-geodetic numbers of Mycielski graph classes.

查看原文本刊更多论文

监测 Mycielskian 图类的边缘大地数

设[公式：见文本]是一个图，[公式：见文本]是[公式：见文本]的顶点集。如果任何一条边出现在集合[公式：见文本]中至少一对顶点的唯一最短路径中，那么[公式：见文本]被定义为监测边-地形集（简称 MEG-集）。我们用 [公式：见正文] 表示 [公式：见正文] 的最小 MEG 集的大小。在本文中，我们研究了 Mycielski 图类的监测边-大地数。

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

求助全文

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

来源期刊

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.