{"id":"W4396240826","doi":"10.61091/jcmcc119-25","title":"An Upper Bound on the Total Roman { 2 } -domination Number of Graphs with Minimum Degree Two","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Babol Noshirvani University of Technology","keywords":"Combinatorics; Mathematics; Domination analysis; Graph; Vertex (graph theory); Minimum weight; Degree (music); Upper and lower bounds; Dominating set; Order (exchange); Induced subgraph; Function (biology); Discrete mathematics; Physics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002679111,0.0002915852,0.0005445571,0.0003000362,0.0003071545,0.0006282491,0.001042152,0.00009461263,0.000009574509],"category_scores_gemma":[0.000233461,0.0001871805,0.0001819217,0.0008186349,0.0002287669,0.0006736626,0.0002273048,0.0006574033,0.000003949995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007075009,"about_ca_system_score_gemma":0.0001987929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004618167,"about_ca_topic_score_gemma":2.598437e-7,"domain_scores_codex":[0.9970189,0.0002823612,0.0008307835,0.0003126173,0.001193953,0.0003614],"domain_scores_gemma":[0.9962122,0.001900523,0.000574513,0.0005323489,0.0005988601,0.0001815473],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000108123,0.0003860401,0.00008440008,0.0001011921,0.0001130857,0.00004473759,0.001407258,0.00006738858,0.00102299,0.9941571,0.00006503266,0.002442682],"study_design_scores_gemma":[0.001931155,0.001643207,0.0001571751,0.000575022,0.00004760962,0.0003475985,0.0002705928,0.03825757,0.002078137,0.9543872,0.00006699459,0.0002377142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9588783,0.0001405527,0.03340724,0.0002739631,0.005704859,0.0002890046,0.00000162573,0.00005092956,0.001253486],"genre_scores_gemma":[0.9912363,0.000009500167,0.008207181,0.00001426516,0.0004850646,0.000003042921,5.329662e-7,0.00003406059,0.00001000018],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03976984,"threshold_uncertainty_score":0.7632999,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0194097962874946,"score_gpt":0.3029665248546538,"score_spread":0.2835567285671592,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}