完全顶点魔术亲切标签

Q4 Mathematics
P. Jeyanthi, N. A. Benseera
{"title":"完全顶点魔术亲切标签","authors":"P. Jeyanthi, N. A. Benseera","doi":"10.55937/sut/1378309917","DOIUrl":null,"url":null,"abstract":"In this paper, we introduce a new labeling called Totally VertexMagic Cordial(TVMC) labeling. A graph G(p, q) is said to be TVMC with a constant C if there is a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + ∑ b∈N(a) f(ab)  ≡ C (mod 2) for all vertices a ∈ V (G) and |nf (0)− nf (1)| ≤ 1, where N(a) is the set of vertices adjacent to the vertex a and nf (i)(i = 0, 1) is the sum of the number of vertices and edges with label i. AMS 2010 Mathematics Subject Classification. 05C78.","PeriodicalId":38708,"journal":{"name":"SUT Journal of Mathematics","volume":"29 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Totally vertex-magic cordial labeling\",\"authors\":\"P. Jeyanthi, N. A. Benseera\",\"doi\":\"10.55937/sut/1378309917\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we introduce a new labeling called Totally VertexMagic Cordial(TVMC) labeling. A graph G(p, q) is said to be TVMC with a constant C if there is a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + ∑ b∈N(a) f(ab)  ≡ C (mod 2) for all vertices a ∈ V (G) and |nf (0)− nf (1)| ≤ 1, where N(a) is the set of vertices adjacent to the vertex a and nf (i)(i = 0, 1) is the sum of the number of vertices and edges with label i. AMS 2010 Mathematics Subject Classification. 05C78.\",\"PeriodicalId\":38708,\"journal\":{\"name\":\"SUT Journal of Mathematics\",\"volume\":\"29 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SUT Journal of Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.55937/sut/1378309917\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SUT Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.55937/sut/1378309917","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 1

摘要

在本文中,我们引入了一种新的标记称为完全VertexMagic Cordial(TVMC)标记。一个图G (p, q)据说是TVMC常数C如果有一个映射f: V (G)∪E (G)→{0,1}这样f (A) +∑b N (A)∈f (ab)≡C (mod 2)∈的所有顶点V (G)和| nf(0)−nf(1) |≤1,N (A)是一组顶点相邻的顶点和nf (i) (i = 0,1)是顶点和边的数量的总和与标签我。AMS 2010数学主题分类。05 c78。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Totally vertex-magic cordial labeling
In this paper, we introduce a new labeling called Totally VertexMagic Cordial(TVMC) labeling. A graph G(p, q) is said to be TVMC with a constant C if there is a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + ∑ b∈N(a) f(ab)  ≡ C (mod 2) for all vertices a ∈ V (G) and |nf (0)− nf (1)| ≤ 1, where N(a) is the set of vertices adjacent to the vertex a and nf (i)(i = 0, 1) is the sum of the number of vertices and edges with label i. AMS 2010 Mathematics Subject Classification. 05C78.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
SUT Journal of Mathematics
SUT Journal of Mathematics Mathematics-Mathematics (all)
CiteScore
0.30
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信