Results 231 to 240 of about 289,295 (264)
Some of the next articles are maybe not open access.
Some results on (1,2)-rainbow connection number
Discret. Appl. Math.zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yingbin Ma, Yuyu Zhao
semanticscholar +3 more sources
Rainbow Connection Number in Pyramid Networks
Proceedings of the 11th International Conference on Computer Modeling and Simulation, 2019Rainbow 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.
Fu-Hsing Wang, Cheng-Ju Hsu
openaire +1 more source
Rainbow Connection Number of Octopus Iteration Graphs
InPrime Indonesian Journal of Pure and Applied MathematicsThe rainbow connection number of a graph G denoted by rc(G) is the minimum number of colors used to color the edges in G, such that every pair of vertices is connected by a path with all different colors. In 2008, Chartrand et al.
D. Rahmadani +4 more
semanticscholar +1 more source
A mathematical model for finding the rainbow connection number
2013 7th International Conference on Application of Information and Communication Technologies, 2013The rainbow connection problem belongs to the class of NP-Hard graph theoretical problems. The rainbow connection of a connected graph G, denoted by rc(G), is the smallest number of colors that are needed in order to make G rainbow edge-connected. In this study, we present a new mathematical model for the rainbow connection problem.
Nuriyeva, Fidan +2 more
openaire +3 more sources
Total rainbow connection number of n-Centipede graph and its line, square, and middle graph
, 2020Let G = (V(G), E(G)) is a nontrivial and connected graph. A path P at G connecting two vertices u and v in a total-colored graph G is said to be a total-rainbow path between u and v if all elements in V(P) ∪ E(P), except for u and v, are assigned ...
Dorotea Rahmawati +3 more
semanticscholar +1 more source
Total Rainbow Connection Number and Complementary Graph
Results in Mathematics, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
The Rainbow Vertex Connection Number of Some Amalgamation of Two Cycles
Tensor: Pure and Applied Mathematics JournalThis paper focuses on rainbow vertex coloring in a graph G, in which, for every two vertices in G, there exists a rainbow vertex path where all internal vertices have distinct colors.
Pranaya D. M. Taihuttu +3 more
semanticscholar +1 more source
International journal of research and innovation in applied science
The Rainbow Vertex Connection Number of a graph is the minimum number of colors required to make a graph rainbow vertex connected. A graph is said to be a rainbow vertex connected if there exists a rainbow vertex path between every pair of distinct ...
V. Jothika, P. Mythili
semanticscholar +1 more source
The Rainbow Vertex Connection Number of a graph is the minimum number of colors required to make a graph rainbow vertex connected. A graph is said to be a rainbow vertex connected if there exists a rainbow vertex path between every pair of distinct ...
V. Jothika, P. Mythili
semanticscholar +1 more source
Rainbow Connection Numbers of Graph Products
2012Products of graphs occur naturally in discrete mathematics as tools in combinatorial constructions and give rise to important classes of graphs and deep structural problems. The extensive literature on products that has evolved over the years presents a wealth of profound and beautiful results, see Imrich and Klavzar (Product Graphs–Structure and ...
Xueliang Li, Yuefang Sun
openaire +1 more source
Distance-local strong rainbow connection number of the sun graph Cn°K¯1
THE 8TH INTERNATIONAL CONFERENCE AND WORKSHOP ON BASIC AND APPLIED SCIENCE (ICOWOBAS) 2021, 2023S. Purwitasari, K. Sugeng
semanticscholar +1 more source