{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008440771,0.001007197,0.0006890078,0.001396074,0.0008976883,0.001745117,0.001200593,0.0005010215,0.004240204],"category_scores_gemma":[0.003969507,0.0003679749,0.0007305995,0.001289684,0.00124463,0.002281528,0.001335692,0.001198363,0.0006167582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001210788,"about_ca_system_score_gemma":0.0006227354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006341569,"about_ca_topic_score_gemma":0.001189794,"domain_scores_codex":[0.9992638,0.0001225261,0.00003232966,0.0001687891,0.0001877773,0.0002247942],"domain_scores_gemma":[0.9959276,0.002629471,0.0003240936,0.0004236191,0.0003040713,0.0003911392],"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.001845066,0.000420703,0.02485942,0.001639819,0.0003634032,0.0008667142,0.001038908,0.1213064,0.1089473,0.5501853,0.01782486,0.1707022],"study_design_scores_gemma":[0.0001657807,0.0005502059,0.01606008,0.0002748178,0.0002860556,0.002365796,0.0003434049,0.3585536,0.0504479,0.531267,0.03956982,0.0001156146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7660683,0.002537247,0.1321539,0.001515387,0.0001585619,0.00009386134,0.001127559,0.000511742,0.09583338],"genre_scores_gemma":[0.954716,0.001299833,0.0339935,0.0002597452,0.0001377704,0.00009579105,0.0008877404,0.0001835677,0.008426028],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004240204,"threshold_uncertainty_score":0.01418495,"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."}}