星图上超均值标记的存在性与不存在性

G. Maheswari, S. J. Obaiys, G. M. J. Jebarani, V. Balaji, Haider Raad
{"title":"星图上超均值标记的存在性与不存在性","authors":"G. Maheswari, S. J. Obaiys, G. M. J. Jebarani, V. Balaji, Haider Raad","doi":"10.3844/ajeassp.2020.658.667","DOIUrl":null,"url":null,"abstract":"Graph theory is one of the mathematical growing areas to simplify the solution of a problem in day today life. Graph theory can be used to modeling a problem that can be easier to see and find the solution for the problem. The graph consisting of nodes called as vertices connected by links called as edges. In the communication networks, the system (graph) is responsible for carrying the messages through the network and directing them along the right path. One of the important areas in Graph theory is Graph labeling for more results on graph labeling can be found in (Gallian, 2010). The field of graph theory plays vital role in various fields. Graph labeling is an assignment of integers to the vertices or edges or both subject to certain conditions and it is used in many applications like coding theory, x-ray crystallography, radar, astronomy, circuit design and communication network. We developed coding techniques for sharing secrecy through Graph labeling in many research article but here we developed the existence and nonexistence of one Graph labeling. By a graph we mean a finite, simple and undirected one. The vertex set and the edge set of a graph G denoted by p and q respectively. The disjoint union of two graphs G1 and G2 is the graph G1G2 with and E(G1G2) = E(G1)E(G2). The disjoint union of two star K1,m and K1,n is denoted by K1,mK1,n. The wedge of two star is obtained by an edge joining two first copy and second copy of two star for all ui and vj such that ( ) ( ) 1 2 2. 2 i j f u f v m     A Graph Labeling (GL) is an","PeriodicalId":7425,"journal":{"name":"American Journal of Engineering and Applied Sciences","volume":"31 1","pages":"658-667"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Existence and Non-Existence of Super Mean Labeling on Star Graphs\",\"authors\":\"G. Maheswari, S. J. Obaiys, G. M. J. Jebarani, V. Balaji, Haider Raad\",\"doi\":\"10.3844/ajeassp.2020.658.667\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Graph theory is one of the mathematical growing areas to simplify the solution of a problem in day today life. Graph theory can be used to modeling a problem that can be easier to see and find the solution for the problem. The graph consisting of nodes called as vertices connected by links called as edges. In the communication networks, the system (graph) is responsible for carrying the messages through the network and directing them along the right path. One of the important areas in Graph theory is Graph labeling for more results on graph labeling can be found in (Gallian, 2010). The field of graph theory plays vital role in various fields. Graph labeling is an assignment of integers to the vertices or edges or both subject to certain conditions and it is used in many applications like coding theory, x-ray crystallography, radar, astronomy, circuit design and communication network. We developed coding techniques for sharing secrecy through Graph labeling in many research article but here we developed the existence and nonexistence of one Graph labeling. By a graph we mean a finite, simple and undirected one. The vertex set and the edge set of a graph G denoted by p and q respectively. The disjoint union of two graphs G1 and G2 is the graph G1G2 with and E(G1G2) = E(G1)E(G2). The disjoint union of two star K1,m and K1,n is denoted by K1,mK1,n. The wedge of two star is obtained by an edge joining two first copy and second copy of two star for all ui and vj such that ( ) ( ) 1 2 2. 2 i j f u f v m     A Graph Labeling (GL) is an\",\"PeriodicalId\":7425,\"journal\":{\"name\":\"American Journal of Engineering and Applied Sciences\",\"volume\":\"31 1\",\"pages\":\"658-667\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"American Journal of Engineering and Applied Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3844/ajeassp.2020.658.667\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"American Journal of Engineering and Applied Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3844/ajeassp.2020.658.667","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

图论是一个不断发展的数学领域,它简化了当今生活中问题的解决方法。图论可以用来对问题进行建模,这样可以更容易地看到并找到问题的解决方案。由称为顶点的节点组成的图,由称为边的链接连接。在通信网络中,系统(图)负责在网络中传递信息,并将其引导到正确的路径上。图论的一个重要领域是图标注,关于图标注的更多结果可以在(Gallian, 2010)中找到。图论领域在各个领域都起着至关重要的作用。图标记是在一定条件下将整数赋值到顶点或边或两者,它被用于许多应用,如编码理论,x射线晶体学,雷达,天文学,电路设计和通信网络。在许多研究文章中,我们开发了通过图标注来共享保密的编码技术,但这里我们只讨论了一个图标注的存在性和不存在性。图是指有限的、简单的、无向的图。图G的顶点集和边集分别用p和q表示。两个图G1和G2的不相交并为图G1G2 with和E(G1G2) = E(G1)E(G2)。两星K1,m和K1,n的不相交并记为K1,mK1,n。通过一条边将所有ui和vj的两个第一个副本和第二个副本连接起来,从而得到()()1 2 2。2 i j f f f v m图标注(GL)是一种方法
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Existence and Non-Existence of Super Mean Labeling on Star Graphs
Graph theory is one of the mathematical growing areas to simplify the solution of a problem in day today life. Graph theory can be used to modeling a problem that can be easier to see and find the solution for the problem. The graph consisting of nodes called as vertices connected by links called as edges. In the communication networks, the system (graph) is responsible for carrying the messages through the network and directing them along the right path. One of the important areas in Graph theory is Graph labeling for more results on graph labeling can be found in (Gallian, 2010). The field of graph theory plays vital role in various fields. Graph labeling is an assignment of integers to the vertices or edges or both subject to certain conditions and it is used in many applications like coding theory, x-ray crystallography, radar, astronomy, circuit design and communication network. We developed coding techniques for sharing secrecy through Graph labeling in many research article but here we developed the existence and nonexistence of one Graph labeling. By a graph we mean a finite, simple and undirected one. The vertex set and the edge set of a graph G denoted by p and q respectively. The disjoint union of two graphs G1 and G2 is the graph G1G2 with and E(G1G2) = E(G1)E(G2). The disjoint union of two star K1,m and K1,n is denoted by K1,mK1,n. The wedge of two star is obtained by an edge joining two first copy and second copy of two star for all ui and vj such that ( ) ( ) 1 2 2. 2 i j f u f v m     A Graph Labeling (GL) is an
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信