• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

十二面体修正广义图上的两种不规则标记。

Two types irregular labelling on dodecahedral modified generalization graph.

作者信息

Hinding Nurdin, Sugeng Kiki A, Wahyudi Timothy J, Simanjuntak Rinovia

机构信息

Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Hasanuddin, Indonesia.

Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Indonesia, Indonesia.

出版信息

Heliyon. 2022 Oct 20;8(11):e11197. doi: 10.1016/j.heliyon.2022.e11197. eCollection 2022 Nov.

DOI:10.1016/j.heliyon.2022.e11197
PMID:36353170
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC9638732/
Abstract

Irregular labelling on graph is a function from component of graph to non-negative natural number such that the weight of all vertices, or edges are distinct. The component of graph is a set of vertices, a set of edges, or a set of both. In this paper we study two types of irregular labelling on dodecahedral modified generalization graph. We determined the total vertex irregularity strength and the modular irregularity strength of dodecahedral modified generalized graph. These results are important because there many classes of graph have the same structure with modified dodecahedral graphs. These results can be used to determine the total vertex irregularity strength and the modular irregularity strength of other graphs that have the similar structure with modified dodecahedral graph.

摘要

图上的不规则标号是一个从图的组件到非负自然数的函数,使得所有顶点或边的权重互不相同。图的组件是一组顶点、一组边或两者皆有。在本文中,我们研究了十二面体修正广义图上的两种不规则标号。我们确定了十二面体修正广义图的全顶点不规则强度和模不规则强度。这些结果很重要,因为有许多类图与修正十二面体图具有相同的结构。这些结果可用于确定与修正十二面体图结构相似的其他图的全顶点不规则强度和模不规则强度。

相似文献

1
Two types irregular labelling on dodecahedral modified generalization graph.十二面体修正广义图上的两种不规则标记。
Heliyon. 2022 Oct 20;8(11):e11197. doi: 10.1016/j.heliyon.2022.e11197. eCollection 2022 Nov.
2
Total Irregularity Strengths of an Arbitrary Disjoint Union of (3,6)- Fullerenes.任意不交并(3,6)-富勒烯的总非正则强度。
Comb Chem High Throughput Screen. 2022;25(3):500-509. doi: 10.2174/1386207323666201209094514.
3
On the centrality of vertices of molecular graphs.关于分子图顶点的中心性。
J Comput Chem. 2013 Nov 5;34(29):2514-23. doi: 10.1002/jcc.23413. Epub 2013 Aug 19.
4
The reflexive edge strength on some almost regular graphs.某些几乎正则图上的自反边强度。
Heliyon. 2021 May 6;7(5):e06991. doi: 10.1016/j.heliyon.2021.e06991. eCollection 2021 May.
5
Bond topology of chain, ribbon and tube silicates. Part I. Graph-theory generation of infinite one-dimensional arrangements of (TO) tetrahedra.链状、带状和管状硅酸盐的键拓扑结构。第一部分。(TO)四面体无限一维排列的图论生成。
Acta Crystallogr A Found Adv. 2022 May 1;78(Pt 3):212-233. doi: 10.1107/S2053273322001747. Epub 2022 Apr 4.
6
Seeing the results of a mutation with a vertex weighted hierarchical graph.通过顶点加权层次图查看突变结果。
BMC Proc. 2014 Aug 28;8(Suppl 2 Proceedings of the 3rd Annual Symposium on Biologica):S7. doi: 10.1186/1753-6561-8-S2-S7. eCollection 2014.
7
On the spectrum, energy and Laplacian energy of graphs with self-loops.关于具有自环的图的谱、能量和拉普拉斯能量。
Heliyon. 2023 Jun 8;9(7):e17001. doi: 10.1016/j.heliyon.2023.e17001. eCollection 2023 Jul.
8
Connectivity of Triangulation Flip Graphs in the Plane.平面三角剖分翻转图的连通性
Discrete Comput Geom. 2022;68(4):1227-1284. doi: 10.1007/s00454-022-00436-2. Epub 2022 Nov 14.
9
Characterization of 2-Path Product Signed Graphs with Its Properties.具有其性质的2-路径积符号图的特征
Comput Intell Neurosci. 2017;2017:1235715. doi: 10.1155/2017/1235715. Epub 2017 Jul 6.
10
A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs.一种对某些平面图类进行 4 着色的线性时间算法。
Comput Intell Neurosci. 2021 Oct 5;2021:7667656. doi: 10.1155/2021/7667656. eCollection 2021.

引用本文的文献

1
A constructive method to determine the total vertex irregularity strength of two flower graph variants.
MethodsX. 2025 Aug 27;15:103587. doi: 10.1016/j.mex.2025.103587. eCollection 2025 Dec.