Browsing Computer Science and Automation (CSA) by Subject "Cartesian Product (Graphs)"
Now showing items 1-1 of 1
-
Rainbow Connection Number Of Graph Power And Graph Products
(2014-09-09)The minimum number of colors required to color the edges of a graph so that any two distinct vertices are connected by at least one path in which no two edges are colored the same is called its rainbow connection number. ...