{"doi":"10.3906/mat-1911-49","title":"The strong 3-rainbow index of edge-amalgamation of some graphs","abstract":null,"journal":"TURKISH JOURNAL OF MATHEMATICS","year":2020,"id":681629,"datarank":0.31191623125197543,"base_score":2.0794415416798357,"endowment":2.0794415416798357,"self_citation_contribution":0.31191623125197543,"citation_network_contribution":0.0,"self_endowment_contribution":0.31191623125197543,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":7,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[],"reference_count":0,"raw_metadata":{"has_enrichment":true,"resolved":true,"title":"The strong 3-rainbow index of edge-amalgamation of some graphs","abstract":"Let G be a nontrivial, connected, and edge-colored graph of order n≥? 3, where adjacent edges may be colored the same. Let k be an integer with 2 ≤? k ≤? n. A tree T in G is a rainbow tree if no two edges of T are colored the same. For S ? V (G), the Steiner distance d(S) of S is the minimum size of a tree in G containing S . An edge-coloring of G is called a strong k-rainbow coloring if for every set S of k vertices of G there exists a rainbow tree of size d(S ) in G containing S. The minimum number of colors needed in a strong k-rainbow coloring of G is called the strong k-rainbow index srxk(G) of G. In this paper, we study the strong 3-rainbow index of edge-amalgamation of graphs. We provide a sharp upper bound for the srx3 of edge-amalgamation of graphs. We also determine the srx3 of edge-amalgamation of some graphs.","is_dataset_classified":null,"base_score":2.0794415416798357,"endowment":2.0794415416798357,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"26207759","pmcid":null,"openalex_id":"https://openalex.org/W3036880973","authors":[],"funders":[],"total_grants":0,"fwci":0.8878,"citation_percentile":0.79718287,"influential_citations":0,"citation_trend":[{"year":2020,"count":2},{"year":2022,"count":3},{"year":2023,"count":2}],"oa_status":"gold","license":"cc-by","oa_locations":[{"url":"https://doi.org/10.3906/mat-1911-49","host_type":"journal"},{"url":"https://doi.org/10.3906/mat-1911-49","host_type":"publisher"},{"url":"https://dergipark.org.tr/tr/pub/tbtkmath/issue/53824/723642","host_type":"repository"}],"fields_of_study":["Advanced Graph Theory Research","Graph Labeling and Dimension Problems","Limits and Structures in Graph Theory"],"mesh_terms":[],"keywords":["Rainbow","Combinatorics","Mathematics","Edge coloring","Colored","Tree (set theory)","Graph","Discrete mathematics","Graph power","Physics","Line graph"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-08-17T18:16:55.783203Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}