{"id":"W2169487918","doi":"10.1016/j.disc.2011.10.018","title":"Upper bounds for the bondage number of graphs on topological surfaces","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Acadia University","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Upper and lower bounds; Genus; Mathematical proof; Domination analysis; Planar graph; Discrete mathematics; Surface (topology); Geometry; Botany; Biology","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.003339844,0.002789583,0.002714212,0.007407651,0.003396295,0.00586879,0.005428367,0.003693458,0.01896175],"category_scores_gemma":[0.0229638,0.00146591,0.001847635,0.004006332,0.005062717,0.01268882,0.00616052,0.007458645,0.002839254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003953163,"about_ca_system_score_gemma":0.0009539174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001047004,"about_ca_topic_score_gemma":0.001881092,"domain_scores_codex":[0.9972977,0.0005790531,0.0001006919,0.0005329055,0.0009907542,0.0004988357],"domain_scores_gemma":[0.9725011,0.01952354,0.001427881,0.002480074,0.001333287,0.002733956],"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.0003409679,0.0001413272,0.001352767,0.0003906343,0.00006903506,0.0001445062,0.0004728152,0.02594784,0.006117286,0.9361564,0.008643543,0.02022291],"study_design_scores_gemma":[0.00002924552,0.0000570105,0.001019326,0.0001152392,0.00005800081,0.0001683087,0.0001047195,0.07674018,0.002647061,0.9124758,0.006527768,0.00005741093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3410772,0.01324885,0.3726067,0.01135948,0.001685933,0.0002464341,0.002233306,0.002378965,0.2551631],"genre_scores_gemma":[0.8835106,0.00717058,0.07560091,0.0009481101,0.001887172,0.0005159905,0.00145405,0.001082052,0.02783047],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01896175,"threshold_uncertainty_score":0.06343341,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06550048523045542,"score_gpt":0.3397857713035316,"score_spread":0.2742852860730762,"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."}}