{"id":"W1519450118","doi":"10.1007/11604686_10","title":"Roman Domination over Some Graph Classes","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Vertex (graph theory); Domination analysis; Graph; Interval graph; Minimum weight; Mathematics; Time complexity; Dominating set; Discrete mathematics; Line graph; Pathwidth","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006922127,0.0004795262,0.0007939281,0.001557268,0.002783367,0.002924266,0.0007227131,0.0006165095,0.01428912],"category_scores_gemma":[0.0019989,0.0004355286,0.0007253115,0.001961936,0.002596505,0.003607013,0.001427968,0.003214912,0.001731251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001691125,"about_ca_system_score_gemma":0.000560753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001338461,"about_ca_topic_score_gemma":0.001711896,"domain_scores_codex":[0.9991969,0.000202387,0.00003326844,0.0001611786,0.0002361836,0.0001700808],"domain_scores_gemma":[0.9988821,0.0005731558,0.00009679954,0.0001247425,0.0001661814,0.0001569181],"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.00001789301,0.000007800117,0.00007108914,0.0000201195,0.000003820131,0.00003440539,0.0001771653,0.0002309284,0.000268531,0.9919802,0.002332186,0.004855821],"study_design_scores_gemma":[0.0000155058,0.000008631972,0.0002069788,0.00001528962,0.000009657353,0.0001530351,0.00008300033,0.001400372,0.0003938231,0.9747846,0.02292173,0.000007450826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1310351,0.001113512,0.043746,0.001781516,0.000256075,0.00006647324,0.0003421023,0.000223402,0.8214357],"genre_scores_gemma":[0.7865865,0.001446332,0.01702226,0.0005648572,0.0004716089,0.0001352297,0.0005027454,0.0003335188,0.192937],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01428912,"threshold_uncertainty_score":0.04780185,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01672967113981929,"score_gpt":0.2842366235948487,"score_spread":0.2675069524550295,"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."}}