{"id":"W2962975014","doi":"","title":"The bondage number of $(n-3)$-regular graphs of order $n$","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Dominating set; Domination analysis; Vertex (graph theory); Graph; Discrete mathematics","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.0002746698,0.0002269049,0.0002834455,0.0008362011,0.00069092,0.0008550472,0.0004052828,0.0004517612,0.002708788],"category_scores_gemma":[0.002279229,0.0002154419,0.0002706463,0.0004514608,0.001091131,0.001472734,0.0004964574,0.0005090148,0.0002547996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006457767,"about_ca_system_score_gemma":0.0003427207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007080309,"about_ca_topic_score_gemma":0.001415055,"domain_scores_codex":[0.9997231,0.00005775731,0.00001495986,0.00007416129,0.0000727137,0.00005716586],"domain_scores_gemma":[0.9982314,0.0009275225,0.0003421638,0.0001424683,0.0001100671,0.0002464986],"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.001357342,0.0001863238,0.04192786,0.0004209285,0.0001314973,0.001213619,0.00151804,0.0683855,0.1069288,0.6933641,0.008701801,0.07586423],"study_design_scores_gemma":[0.0000864006,0.0003547556,0.02714506,0.0000655664,0.00007661687,0.002391272,0.0006702812,0.1772651,0.03715739,0.7347769,0.01990646,0.000104238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9603445,0.0003125669,0.02218423,0.0003311544,0.00003575447,0.00002418429,0.0003264029,0.0001010681,0.01634025],"genre_scores_gemma":[0.9875945,0.000226274,0.009081029,0.00003725349,0.00002274937,0.00003006196,0.0001924208,0.0000316043,0.002784043],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002708788,"threshold_uncertainty_score":0.009061813,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01897091085986724,"score_gpt":0.2758323996745476,"score_spread":0.2568614888146803,"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."}}