Open Support of Hypergraphs under Addition

Author:

Wu Shufei,Wang Mengyuan

Abstract

For a vertex v in a graph G, the open support of v under addition is the sum of degrees of all its neighbors. The open support of G under addition is the sum of open supports of all its vertices. The results for open support of graphs are deeply dependent on the structure property of the graph considered, such as its symmetry. In this paper, we generalize the concept of open support to hypergraphs. We give some examples and prove a general formula for open support of hypergraphs by using the adjacency and incidence matrices method.

Funder

National Natural Science Foundation of China

Publisher

MDPI AG

Subject

Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)

Reference20 articles.

1. A note on open support of a graph under addition I;Balamurugan;Int. J. Math. Trends Technol.,2019

2. A note on open support of a graph under addition II;Balamurugan;Int. J. Math. Trends Technol.,2019

3. Closed support of a graph under addition I;Balamurugan;Int. J. Math. Trends Technol.,2019

4. Closed support of a graph under addition II;Balamurugan;Int. J. Math. Trends Technol.,2019

5. Basic study with support and support value of connected network graph support study for special graph;Thiagarajan;Int. J. Innov. Technol. Explor. Eng.,2019

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

1. Formulation of Twin graph labelings;Neural Computing and Applications;2024-08-01

2. A Vulnerability Measure of k-Uniform Linear Hypergraphs;Symmetry;2023-06-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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