Safe sets, network majority on weighted trees-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Safe sets, network majority on weighted trees

Published:2017-11-16 Issue:1 Volume:71 Page:81-92
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:NETWORKS

Author:

Bapat Ravindra B.¹,Fujita Shinya²,Legay Sylvain³,Manoussakis Yannis³,Matsui Yasuko⁴,Sakuma Tadashi⁵,Tuza Zsolt⁶⁷

Affiliation:

1. Indian Statistical Institute; New Delhi India

2. International College of Arts and Sciences; Yokohama City University; Yokohama Japan

3. Laboratoire de Recherche en Informatique, University Paris-Sud; Orsay Cedex France

4. Department of Mathematical Sciences, Faculty of Science; Tokai University; Hiratsuka Japan

5. Systems Science and Information Studies, Faculty of Education, Art and Science; Yamagata University; Yamagata Japan

6. Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences; Budapest Hungary

7. Department of Computer Science and Systems Technology; University of Pannonia; Veszprém Hungary

Funder

the JC Bose Fellowship, Department of Science and Technology, Government of India

Scientific Research (C)

The National Research, Development and Innovation Office - NKFIH

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference22 articles.

1. On the range of possible integrities of graphs G(n, k);Atici;Graphs Comb.,2011

2. A survey of integrity;Bagga;Discrete Appl. Math.,1992

3. Network majority on tree topological network, Proceedings of the 10th edition of the Jornadas de Matematica Discreta y Algoritmica (the 10th JMDA);Bapat;Electron. Notes Discrete Math.,2016

4. Asymptotic bounds on the integrity of graphs and separator theorems for graphs;Benko;SIAM J. Discrete Math.,2009

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Safe sets and in-dominating sets in digraphs;Discrete Applied Mathematics;2024-03

2. Robustness in Mesh Networks Using Connected Safe Set and Applications;IEEE Access;2024

3. The Connected Critical Node Problem;Theoretical Computer Science;2022-06

4. On the Connected Safe Number of Some Classes of Graphs;Journal of Mathematics;2021-10-23

5. Stable structure on safe set problems in vertex-weighted graphs;European Journal of Combinatorics;2021-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3