关于诚恳有向图的一些结果

离散数学期刊(英文) Pub Date : 2020-01-01 DOI:10.4236/ojdm.2020.101002

M. M. Al-Shamiri, S. Nada, A. Elrokh, Yasser Elmshtaye

{"title":"关于诚恳有向图的一些结果","authors":"M. M. Al-Shamiri, S. Nada, A. Elrokh, Yasser Elmshtaye","doi":"10.4236/ojdm.2020.101002","DOIUrl":null,"url":null,"abstract":"A digraph is a graph in which each edge has an orientation. A linear directed path, , is a path whose all edges have the same orientation. A linear simple graph is called directed cordial if it admits 0 - 1 labeling that satisfies certain condition. In this paper, we study the cordiality of directed paths and their second power . Similar studies are done for and the join . We show that , and are directed cordial. Sufficient conditions are given to the join to be directed cordial.","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":"10 1","pages":"4-12"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Some Results on Cordial Digraphs\",\"authors\":\"M. M. Al-Shamiri, S. Nada, A. Elrokh, Yasser Elmshtaye\",\"doi\":\"10.4236/ojdm.2020.101002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A digraph is a graph in which each edge has an orientation. A linear directed path, , is a path whose all edges have the same orientation. A linear simple graph is called directed cordial if it admits 0 - 1 labeling that satisfies certain condition. In this paper, we study the cordiality of directed paths and their second power . Similar studies are done for and the join . We show that , and are directed cordial. Sufficient conditions are given to the join to be directed cordial.\",\"PeriodicalId\":61712,\"journal\":{\"name\":\"离散数学期刊(英文)\",\"volume\":\"10 1\",\"pages\":\"4-12\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"离散数学期刊(英文)\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.4236/ojdm.2020.101002\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"离散数学期刊(英文)","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.4236/ojdm.2020.101002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

有向图是每条边都有一个方向的图。线性有向路径是所有边方向相同的路径。如果线性简单图允许满足一定条件的0 - 1标记，则称为有向诚恳图。本文研究了有向路径的亲切性及其二次幂。类似的研究也在进行中。我们表明了这一点，并受到亲切的指导。给出了连接可定向的充分条件。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Some Results on Cordial Digraphs

A digraph is a graph in which each edge has an orientation. A linear directed path, , is a path whose all edges have the same orientation. A linear simple graph is called directed cordial if it admits 0 - 1 labeling that satisfies certain condition. In this paper, we study the cordiality of directed paths and their second power . Similar studies are done for and the join . We show that , and are directed cordial. Sufficient conditions are given to the join to be directed cordial.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

离散数学期刊(英文)

自引率

0.00%

发文量

127