{"id":"W2737290634","doi":"","title":"A Sharp Upper Bound on Algebraic Connectivity Using Domination Number","year":2009,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Domination analysis; Algebraic connectivity; Mathematics; Combinatorics; Dominating set; Vertex (graph theory); Upper and lower bounds; Connectivity; Algebraic number; Laplacian matrix; Discrete mathematics; Graph; Eigenvalues and eigenvectors","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.001865131,0.001794752,0.001543753,0.00432826,0.001600143,0.003098727,0.002099733,0.001624115,0.005597981],"category_scores_gemma":[0.0211096,0.000807124,0.001110441,0.002661751,0.004151417,0.007424109,0.003983333,0.00403909,0.0006788349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001791913,"about_ca_system_score_gemma":0.0004488403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007516218,"about_ca_topic_score_gemma":0.0009715289,"domain_scores_codex":[0.9979281,0.0004617722,0.00007088418,0.00051197,0.0005966181,0.0004305933],"domain_scores_gemma":[0.9793393,0.01649169,0.001214236,0.0009193396,0.0009909353,0.001044497],"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.0003609845,0.0001196426,0.004293751,0.0006934025,0.0001461775,0.0008941352,0.0006649422,0.06219618,0.01652358,0.8627853,0.009162324,0.04215958],"study_design_scores_gemma":[0.00004279886,0.000191562,0.003453486,0.0002887181,0.0001381161,0.001455034,0.0002310034,0.1633973,0.006110788,0.8125487,0.01202538,0.0001170726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3089576,0.01613662,0.5449132,0.007294226,0.0006195144,0.0001730814,0.00120336,0.00102968,0.1196728],"genre_scores_gemma":[0.9504972,0.005310534,0.03748847,0.0008253722,0.0007677276,0.0001763239,0.000414644,0.00017689,0.004342802],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005597981,"threshold_uncertainty_score":0.01872712,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02731860538795752,"score_gpt":0.3034622719581938,"score_spread":0.2761436665702363,"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."}}