{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000509566,0.0002458271,0.0003018225,0.0001135597,0.000283584,0.00003867082,0.0001372519,0.0001418155,0.000218413],"category_scores_gemma":[0.0004602971,0.0002233497,0.0001420521,0.000313763,0.0001630751,0.0001315835,0.00005045104,0.0002723104,0.00004731098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001092927,"about_ca_system_score_gemma":0.00002501084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001742798,"about_ca_topic_score_gemma":0.00002458148,"domain_scores_codex":[0.9986266,0.0001606457,0.0003096192,0.0004089205,0.0001549513,0.0003392932],"domain_scores_gemma":[0.9985941,0.0005949232,0.0001018768,0.000481194,0.00005682004,0.000171071],"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.00001356346,0.0001985944,0.001661468,0.00004008337,0.00005293333,0.000003977756,0.0002775537,0.000001884053,0.00225023,0.9926429,0.0002109274,0.00264583],"study_design_scores_gemma":[0.001601116,0.00005935288,0.00206195,0.00003546496,0.0001042362,0.00004271301,0.0002598225,0.003360286,0.01614069,0.958365,0.01747716,0.0004921529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9920767,0.0002032171,0.0029249,0.00007869848,0.000106649,0.0003632467,0.00002025159,0.0002056765,0.004020669],"genre_scores_gemma":[0.9817433,0.00006358061,0.01722259,0.000234544,0.00005576064,0.00003981159,0.000009094261,0.00004639021,0.0005849352],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0342779,"threshold_uncertainty_score":0.9107936,"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."}}