连通绕行数2图的表征

IF 1 Q1 MATHEMATICS Kragujevac Journal of Mathematics Pub Date : 2023-01-01 DOI:10.46793/kgjmat2301.119m

Gashaw A. Mohammedsaleh

{"title":"连通绕行数2图的表征","authors":"Gashaw A. Mohammedsaleh","doi":"10.46793/kgjmat2301.119m","DOIUrl":null,"url":null,"abstract":"Let G = (V,E) be a connected graph of order P(G) ≥ 2. The connected detour number of G, denoted cdn(G), is introduced and studied by A. P. Santhakumaran and S. Athisayanathan [?]. In this paper, we characterize connected graph G of cdn(G) = 2 and of detour diameter D(G) = 5, 6.","PeriodicalId":44902,"journal":{"name":"Kragujevac Journal of Mathematics","volume":" ","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Characterization of Graphs of Connected Detour Number 2\",\"authors\":\"Gashaw A. Mohammedsaleh\",\"doi\":\"10.46793/kgjmat2301.119m\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G = (V,E) be a connected graph of order P(G) ≥ 2. The connected detour number of G, denoted cdn(G), is introduced and studied by A. P. Santhakumaran and S. Athisayanathan [?]. In this paper, we characterize connected graph G of cdn(G) = 2 and of detour diameter D(G) = 5, 6.\",\"PeriodicalId\":44902,\"journal\":{\"name\":\"Kragujevac Journal of Mathematics\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Kragujevac Journal of Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.46793/kgjmat2301.119m\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Kragujevac Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46793/kgjmat2301.119m","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

设G = (V,E)为P(G)阶≥2的连通图。A. P. Santhakumaran和S. Athisayanathan[?]引入并研究了G的连通绕路数cdn(G)。本文刻画了cdn(G) = 2，绕行直径D(G) = 5,6的连通图G。

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

查看原文

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

本刊更多论文

Characterization of Graphs of Connected Detour Number 2

Let G = (V,E) be a connected graph of order P(G) ≥ 2. The connected detour number of G, denoted cdn(G), is introduced and studied by A. P. Santhakumaran and S. Athisayanathan [?]. In this paper, we characterize connected graph G of cdn(G) = 2 and of detour diameter D(G) = 5, 6.

求助全文

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

来源期刊