{"title":"Rainbow Connection Number in Pyramid Networks","authors":"Fu-Hsing Wang, Cheng-Ju Hsu","doi":"10.1145/3307363.3307405","DOIUrl":null,"url":null,"abstract":"Rainbow connection number of a connected graph G is the minimum number of colors needed to color the edges of G, so that every pair of vertices is connected by at least one path whose edges have distinct colors. In this paper, we propose a linear time algorithm for constructing a rainbow coloring on pyramids.","PeriodicalId":130820,"journal":{"name":"Proceedings of the 11th International Conference on Computer Modeling and Simulation","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 11th International Conference on Computer Modeling and Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3307363.3307405","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Rainbow connection number of a connected graph G is the minimum number of colors needed to color the edges of G, so that every pair of vertices is connected by at least one path whose edges have distinct colors. In this paper, we propose a linear time algorithm for constructing a rainbow coloring on pyramids.