{"id":"W2016746591","doi":"10.1080/0308108031000069182","title":"Maximizing Algebraic Connectivity Over Unicyclic Graphs","year":2003,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Graph theory and applications","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; University of Regina","keywords":"Combinatorics; Mathematics; Algebraic connectivity; Vertex (graph theory); Discrete mathematics; Graph; Algebraic number; Upper and lower bounds; Line graph","routes":{"ca_aff":true,"ca_fund":true,"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.000409683,0.0004299462,0.0004844075,0.001029259,0.0008433283,0.0008475629,0.0005435162,0.0003808449,0.002654402],"category_scores_gemma":[0.003111241,0.0002032521,0.0002184136,0.001437959,0.001058297,0.00155993,0.0009318769,0.0003790328,0.0001571445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006038653,"about_ca_system_score_gemma":0.0002545427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008049188,"about_ca_topic_score_gemma":0.001274496,"domain_scores_codex":[0.9995648,0.0001124207,0.00001765018,0.0001142273,0.00008918003,0.0001017089],"domain_scores_gemma":[0.9981375,0.0008869002,0.0004454388,0.0001298895,0.0001849347,0.0002153381],"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.000101583,0.00003578295,0.002939952,0.000172301,0.00002744537,0.0004055878,0.000370822,0.05620258,0.009129636,0.8935239,0.002197471,0.03489294],"study_design_scores_gemma":[0.0000304431,0.00009499819,0.00257211,0.00003538423,0.0000295813,0.0009266667,0.0003890402,0.1342281,0.00499418,0.8491661,0.007504302,0.00002923627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.872444,0.0005001204,0.08868693,0.0004274614,0.00002247289,0.00004383055,0.0002148785,0.0001330119,0.03752724],"genre_scores_gemma":[0.9875566,0.0003525856,0.01045604,0.00004063187,0.00003308054,0.00002631911,0.0001143639,0.00002309405,0.001397311],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002654402,"threshold_uncertainty_score":0.00887984,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03591247004722319,"score_gpt":0.3132328064926379,"score_spread":0.2773203364454147,"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."}}