Signed Product Cordial of the Sum and Union of Two Fourth Power of Paths and Cycles

Transactions on machine learning research Pub Date : 2019-12-30 DOI:10.11648/J.MLR.20190404.11

S. Nada, A. Elrayes, A. Elrokh, A. Rabie

引用次数: 0

Abstract

A simple graph is said to be signed product cordial if it admits ±1 labeling that satisfies certain conditions. Our aim in this paper is to contribute some new results on signed product cordial labeling and present necessary and sufficient conditions for signed product cordial of the sum and union of two fourth power of paths. We also study the signed product cordiality of the sum and union of fourth power cycles The residue classes modulo 4 are accustomed to find suitable labelings for each class to achieve our task. We have shown that the union and the join of any two fourth power of paths are always signed product cordial. Howover, the join and union of fourth power of cycles are only signed codial with some expectional situations.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

路径与环的两次四次幂和并的签名积

在满足一定条件的情况下，允许±1标注的简单图称为有符号的产品。本文的目的是给出一些关于可签名积亲切标记的新结果，并给出两个路径的四次和并的可签名积亲切的充要条件。我们还研究了四次幂环的和与并的有符号乘积的亲切性，以4为模的剩余类习惯于为每个类找到合适的标记来完成我们的任务。我们证明了任意两个路径的四次幂的并并和连接总是有符号积亲切的。然而，环的四次幂的连接和并只在一些期望的情况下才有符号。

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

求助全文

约1分钟内获得全文去求助

来源期刊

Transactions on machine learning research

自引率

0.00%

发文量

期刊最新文献

Federated Learning with Convex Global and Local Constraints. Online model selection by learning how compositional kernels evolve. Beyond Distribution Shift: Spurious Features Through the Lens of Training Dynamics. RIFLE: Imputation and Robust Inference from Low Order Marginals. On the Convergence and Calibration of Deep Learning with Differential Privacy.