• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

连通图的 - 阴影和闭阴影的反幻覆盖

On -antimagic coverings for -shadow and closed -shadow of connected graphs.

作者信息

Inayah Nur, Susanto Faisal, Semaničová-Feňovčíková Andrea

机构信息

Department of Mathematics, Faculty of Science and Technology, Syarif Hidayatullah State Islamic University Jakarta, Jalan Ir. H. Djuanda 95, Ciputat 15412, Indonesia.

Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Tadulako, Jalan Soekarno Hatta Km. 9, Palu 94118, Indonesia.

出版信息

Heliyon. 2021 Oct 18;7(10):e08203. doi: 10.1016/j.heliyon.2021.e08203. eCollection 2021 Oct.

DOI:10.1016/j.heliyon.2021.e08203
PMID:34712860
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC8529510/
Abstract

An --antimagic total labeling of a simple graph admitting an -covering is a bijection such that for all subgraphs of isomorphic to , the set of -weights given by forms an arithmetic sequence where , are two fixed integers and is the number of all subgraphs of isomorphic to . Moreover, such a labeling is called super if the smallest possible labels appear on the vertices. A (super) --antimagic graph is a graph that admits a (super) --antimagic total labeling. In this paper the existence of super --antimagic total labelings for the -shadow and the closed -shadow of a connected for several values of is proved.

摘要

对于一个允许(r)-覆盖的简单图(G),一个((k,d))-反魔法全标号是一个双射(f:V(G)\cup E(G)\to{1,2,\cdots,|V(G)| + |E(G)|}),使得对于(G)的所有同构于(rK_2)的子图(H),由(w_f(H)=\sum_{x\in V(H)}f(x)+\sum_{e\in E(H)}f(e))给出的(r)-权重集合形成一个等差数列,其中(k,d)是两个固定整数,(n)是(G)中所有同构于(rK_2)的子图的数量。此外,如果最小可能的标签出现在顶点上,则这样的标号(f)称为超级的。一个(超级)((k,d))-反魔法图是一个允许(超级)((k,d))-反魔法全标号的图。在本文中,证明了对于几个(r)值,连通图(G)的(r)-影子和闭(r)-影子存在超级((k,d))-反魔法全标号。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d864/8529510/9fd470d2f57f/gr002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d864/8529510/42dab80eaddb/gr001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d864/8529510/9fd470d2f57f/gr002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d864/8529510/42dab80eaddb/gr001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d864/8529510/9fd470d2f57f/gr002.jpg

相似文献

1
On -antimagic coverings for -shadow and closed -shadow of connected graphs.连通图的 - 阴影和闭阴影的反幻覆盖
Heliyon. 2021 Oct 18;7(10):e08203. doi: 10.1016/j.heliyon.2021.e08203. eCollection 2021 Oct.
2
On the antimagicness of generalized edge corona graphs.关于广义边冠图的反魔法性
Heliyon. 2024 Jan 5;10(2):e24002. doi: 10.1016/j.heliyon.2024.e24002. eCollection 2024 Jan 30.
3
On the super edge-magic deficiency of some graphs.关于某些图的超边魔幻亏度
Heliyon. 2020 Nov 20;6(11):e05561. doi: 10.1016/j.heliyon.2020.e05561. eCollection 2020 Nov.
4
Randić energy of digraphs.有向图的兰迪奇能量
Heliyon. 2022 Nov 24;8(11):e11874. doi: 10.1016/j.heliyon.2022.e11874. eCollection 2022 Nov.
5
Local total anti-magic chromatic number of graphs.图的局部全反魔法色数
Heliyon. 2023 Jul 4;9(7):e17761. doi: 10.1016/j.heliyon.2023.e17761. eCollection 2023 Jul.
6
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs.用于寻找大型诱导稀疏子图的亚指数时间算法。
Algorithmica. 2021;83(8):2634-2650. doi: 10.1007/s00453-020-00745-z. Epub 2020 Jul 31.
7
Edge Mostar Indices of Cacti Graph With Fixed Cycles.具有固定圈的仙人掌图的边莫斯塔指数
Front Chem. 2021 Jul 9;9:693885. doi: 10.3389/fchem.2021.693885. eCollection 2021.
8
L(2,1)-labeling of the strong product of paths and cycles.路径与圈的强积的L(2,1)-标号
ScientificWorldJournal. 2014 Feb 24;2014:741932. doi: 10.1155/2014/741932. eCollection 2014.
9
Sombor index of directed graphs.有向图的索姆博尔指数。
Heliyon. 2022 Mar 1;8(3):e09035. doi: 10.1016/j.heliyon.2022.e09035. eCollection 2022 Mar.
10
Local Multiset Dimension of Amalgamation Graphs.并图的局部多重集维数。
F1000Res. 2024 Apr 23;12:95. doi: 10.12688/f1000research.128866.2. eCollection 2023.