In general, the investigation of k-vertex-rainbow index of a graph may be harder than that of k-rainbow index of a graph. For example, it is noticed that rx2(G)≤rx3(G)≤≤rxn(G) for every connected graph G of order n, but we show that this monotonicity of vertex-rainbow index ...
Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey Nowadays the term monochromatic and heterochromatic (or rainbow, multicolored) subgraphs of an edge-colored graph appeared frequently in literature, and ma... M Kano,X Li - 《Graphs & Combinatorics》...
Trina Solar will supply the project with 205,161 panels of its advanced Vertex modules. It is set to provide the power needed for the operations of African Rainbow Minerals, one of South Africa's foremost mining companies, underlining the commitment to harnessing clean and efficient energy sources...
A comparative analysis of the energy with nonisogeny signature schemes SPHINCS (9) and Rainbow (30) are presented. The total number of clock cycles is also analysed and compared with the isogeny based schemes Efficient Algorithms for Supersingular Isogeny (EASI) (16), Microsoft’s Supersingular...
Figure 6. The “rainbow” of 0.1 mM spiropyran solution in different solvents under various light stimuli. The “yellow light” means light in the laboratory where the experiments are conducted, which is in our case 570 nm. Figure 7. Normalized absorption spectra of 0.1 mM SP before irradiatio...
The strong rainbow vertex-connection number, represented by srvc(G) is the fewest number of colors needed for strong rainbow vertex coloring of the graph G. This paper explores sharp upper bounds for the strong rainbow vertex-connection number of GP graphs P(n,k) for the cases when k|n ...
The k -vertex-rainbow index of G , denoted by \\(rvx_{k}(G)\\) , is the minimum number of colors that are needed in order to make G vertex-rainbow k -tree connected. In this paper, we study the 3-vertex-rainbow index of unicyclic graphs and complementary graphs, respectively....
We give a coloring so that the graph is rainbow vertex-connected. The rainbow vertex-connection number of the small-world Farey graph, which is the minimum number of colors needed so that the graph is rainbow vertex-connected, is one less than the diameter of the graph....
Li and Y. Shi, The complexity of determining the rainbow vertex-connection of a graph, Theoret. Comput. Sci. 412(2011), 4531- 4535.Chen L L, Li X L, Shi Y T. The complexity of determining the rainbow vertex-connection of graphs. Theoret Comput Sci, 2011, 412: 4531-4535...
The k -vertex-rainbow index of G , denoted by \\(rvx_{k}(G)\\) , is the minimum number of colors that are needed in order to make G vertex-rainbow k -tree connected. In this paper, we study the 3-vertex-rainbow index of unicyclic graphs and complementary graphs, respectively....