发布求助
文献互助 智能选刊 最新文献

Open journal of Discrete Mathematics最新文献

筛选
英文 中文
New Results on One Modulo N-Difference Mean Graphs 一模n差分平均图的新结果
Open journal of Discrete Mathematics Pub Date : 2023-01-01 DOI: 10.4236/ojdm.2023.134010
Pon Jeyanthi, Meganathan Selvi, Damodaran Ramya
{"title":"New Results on One Modulo N-Difference Mean Graphs","authors":"Pon Jeyanthi, Meganathan Selvi, Damodaran Ramya","doi":"10.4236/ojdm.2023.134010","DOIUrl":"https://doi.org/10.4236/ojdm.2023.134010","url":null,"abstract":"A graph G is said to be one modulo N-difference mean graph if there is an injective function f from the vertex set of G to the set , where N is the natural number and q is the number of edges of G and f induces a bijection from the edge set of G to given by and the function f is called a one modulo N-difference mean labeling of G. In this paper, we show that the graphs such as arbitrary union of paths, , ladder, slanting ladder, diamond snake, quadrilateral snake, alternately quadrilateral snake, , , , , friendship graph and admit one modulo N-difference mean labeling.","PeriodicalId":222803,"journal":{"name":"Open journal of Discrete Mathematics","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135107338","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Cycle Multiplicity of Total Graph of Complete Bipartite Graph 完全二部图的全图的循环多重性
Open journal of Discrete Mathematics Pub Date : 2023-01-01 DOI: 10.4236/ojdm.2023.134009
Ganghua Xie, Yinkui Li
{"title":"Cycle Multiplicity of Total Graph of Complete Bipartite Graph","authors":"Ganghua Xie, Yinkui Li","doi":"10.4236/ojdm.2023.134009","DOIUrl":"https://doi.org/10.4236/ojdm.2023.134009","url":null,"abstract":"Cycle multiplicity of a graph G is the maximum number of edge disjoint cycles in G. In this paper, we determine the cycle multiplicity of and then obtain the formula of cycle multiplicity of total graph of complete bipartite graph, this generalizes the result for, which is given by M.M. Akbar Ali in [1].","PeriodicalId":222803,"journal":{"name":"Open journal of Discrete Mathematics","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135798558","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书