Monitoring Edge-Geodetic Numbers of Mycielskian Graph Classes

Author:

Li Xin1ORCID,Li Wen23ORCID,Tan Ao1ORCID,He Mengmeng3ORCID,Chen Weizhen1ORCID

Affiliation:

1. School of Mathematics and Statistics, Qinghai Normal University, Xining, Qinghai 810008, P. R. China

2. School of Mathematics and Statistics, Qinghai Minzu University, Xining, Qinghai 810007, P. R. China

3. School of Computer, Qinghai Normal University, Xining, Qinghai 810008, P. R. China

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.

Funder

National Science Foundation of China

Qinghai Key Laboratory of Internet of Things Project

Science & Technology development Fund of Tianjin Education Com-mission for Higher Education, China

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