...
首页> 外文期刊>Machine Learning Research >Signed Product Cordial of the Sum and Union of Two Fourth Power of Paths and Cycles
【24h】

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

机译:签署的产品亲切的两个第四个路径和循环的联盟

获取原文

摘要

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.
机译:如果承认满足某些条件的±1标记,则据说简单的图表被签名产品。我们本文的宗旨是为签名产品亲切标签和签署产品的必要和充分条件进行贡献一些新的结果,签署的第四个路径的第四个权力和联盟的签名产品。我们还研究了第四电源周期的总和和联盟的签名产品亲密性,习惯于找到每个班级的合适贴标以实现我们的任务。我们已经表明,联盟和任何两个路径的连接总是签署了产品亲切。 HOWOVER,第四次循环电源的联接和联盟仅符合多种违规情况。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号