阶梯图和罗奇图的彩虹顶点连接数

Ceylon Journal of Science Pub Date : 2023-09-01 DOI:10.4038/cjs.v52i3.8045

W. D. D. P. Dewananda, K. K. K. R. Perera

{"title":"阶梯图和罗奇图的彩虹顶点连接数","authors":"W. D. D. P. Dewananda, K. K. K. R. Perera","doi":"10.4038/cjs.v52i3.8045","DOIUrl":null,"url":null,"abstract":"A vertex-coloured graph G is said to be rainbow vertex-connected, if every two vertices of G are connected by a path whose internal vertices have distinct colours. The rainbow vertex-connection number of a connected graph G, denoted by rvc(G), is the smallest number of colours that are needed to make G, a rainbow vertex-connected. This study focuses on deriving formulas for the rainbow vertex connectivity number of a simple ladder graph and a roach graph.","PeriodicalId":9894,"journal":{"name":"Ceylon Journal of Science","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The rainbow vertex connection number of ladder graphs and Roach graphs\",\"authors\":\"W. D. D. P. Dewananda, K. K. K. R. Perera\",\"doi\":\"10.4038/cjs.v52i3.8045\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A vertex-coloured graph G is said to be rainbow vertex-connected, if every two vertices of G are connected by a path whose internal vertices have distinct colours. The rainbow vertex-connection number of a connected graph G, denoted by rvc(G), is the smallest number of colours that are needed to make G, a rainbow vertex-connected. This study focuses on deriving formulas for the rainbow vertex connectivity number of a simple ladder graph and a roach graph.\",\"PeriodicalId\":9894,\"journal\":{\"name\":\"Ceylon Journal of Science\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ceylon Journal of Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4038/cjs.v52i3.8045\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ceylon Journal of Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4038/cjs.v52i3.8045","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

如果G的每两个顶点都由一条内部顶点具有不同颜色的路径连接，则称顶点着色图G是彩虹顶点连接的。连通图G的彩虹顶点连通数，用rvc（G）表示，是使G（彩虹顶点连通）所需的最小颜色数。本文着重推导了简单梯形图和罗奇图的彩虹顶点连通数的计算公式。

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

查看原文本刊更多论文

The rainbow vertex connection number of ladder graphs and Roach graphs

A vertex-coloured graph G is said to be rainbow vertex-connected, if every two vertices of G are connected by a path whose internal vertices have distinct colours. The rainbow vertex-connection number of a connected graph G, denoted by rvc(G), is the smallest number of colours that are needed to make G, a rainbow vertex-connected. This study focuses on deriving formulas for the rainbow vertex connectivity number of a simple ladder graph and a roach graph.

求助全文

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

来源期刊

Ceylon Journal of Science

自引率

0.00%

发文量

审稿时长

15 weeks