有路径 Pm 的双三角形蛇形图笛卡儿积的交叉数

Journal of Advanced Zoology Pub Date : 2024-02-29 DOI:10.53555/jaz.v44is8.4099

Pathak Manojkumar Vijaynath, Dr. Nithya Sai Narayana

{"title":"有路径 Pm 的双三角形蛇形图笛卡儿积的交叉数","authors":"Pathak Manojkumar Vijaynath, Dr. Nithya Sai Narayana","doi":"10.53555/jaz.v44is8.4099","DOIUrl":null,"url":null,"abstract":"The crossing number Cr(G) of a graph G is the least number of edge crossings in all possible good drawings of G in the plane. Join and Cartesian products of graphs have many interesting graph-theoretical properties. In this paper, we evaluate the crossing number of the Cartesian product of double triangular snake graph DT2 with the path Pm. In this paper, we proved Cr(DT2 × Pm) = 6(m − 2), form ≥ 2 where Cr denotes the crossing number","PeriodicalId":509303,"journal":{"name":"Journal of Advanced Zoology","volume":"95 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Crossing Numbers of the Cartesian Product of the Double Triangular Snake Graphs With Path Pm.\",\"authors\":\"Pathak Manojkumar Vijaynath, Dr. Nithya Sai Narayana\",\"doi\":\"10.53555/jaz.v44is8.4099\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The crossing number Cr(G) of a graph G is the least number of edge crossings in all possible good drawings of G in the plane. Join and Cartesian products of graphs have many interesting graph-theoretical properties. In this paper, we evaluate the crossing number of the Cartesian product of double triangular snake graph DT2 with the path Pm. In this paper, we proved Cr(DT2 × Pm) = 6(m − 2), form ≥ 2 where Cr denotes the crossing number\",\"PeriodicalId\":509303,\"journal\":{\"name\":\"Journal of Advanced Zoology\",\"volume\":\"95 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-02-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Advanced Zoology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.53555/jaz.v44is8.4099\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Advanced Zoology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.53555/jaz.v44is8.4099","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

图形 G 的交叉数 Cr(G) 是图形 G 在平面上所有可能的好图中最少的边交叉数。图的连接和笛卡尔积具有许多有趣的图论性质。在本文中，我们评估了双三角蛇形图 DT2 与路径 Pm 的笛卡尔积的交叉数。本文证明了 Cr(DT2 × Pm) = 6(m - 2), form ≥ 2，其中 Cr 表示交叉数

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

查看原文

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

本刊更多论文

Crossing Numbers of the Cartesian Product of the Double Triangular Snake Graphs With Path Pm.

The crossing number Cr(G) of a graph G is the least number of edge crossings in all possible good drawings of G in the plane. Join and Cartesian products of graphs have many interesting graph-theoretical properties. In this paper, we evaluate the crossing number of the Cartesian product of double triangular snake graph DT2 with the path Pm. In this paper, we proved Cr(DT2 × Pm) = 6(m − 2), form ≥ 2 where Cr denotes the crossing number

求助全文

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

来源期刊

Journal of Advanced Zoology

自引率

0.00%

发文量