{"id":"W2144008971","doi":"10.1016/j.laa.2014.12.023","title":"Maximizing algebraic connectivity for certain families of graphs","year":2015,"lang":"en","type":"preprint","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Algebraic connectivity; Mathematics; Bounded function; Algebraic number; Upper and lower bounds; Graph; Girth (graph theory); Discrete mathematics; 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.001406925,0.0007698554,0.0008853632,0.002988522,0.001943178,0.003154735,0.001241969,0.001580293,0.005298029],"category_scores_gemma":[0.008666886,0.0007151824,0.0006338626,0.002567685,0.002893487,0.005606691,0.001820714,0.001867345,0.0002473468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001591552,"about_ca_system_score_gemma":0.000480651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009656823,"about_ca_topic_score_gemma":0.001517559,"domain_scores_codex":[0.9991754,0.0003219139,0.00002625895,0.0001948278,0.000187571,0.00009409882],"domain_scores_gemma":[0.9934039,0.004159254,0.000950209,0.0002775404,0.0004345179,0.0007746399],"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.00002109829,0.00001883324,0.0005801301,0.0000371404,0.000009542893,0.00006310148,0.0002029965,0.002499928,0.0005284246,0.9921589,0.001219968,0.002659959],"study_design_scores_gemma":[0.0000148452,0.00001012756,0.0004858277,0.000014272,0.00001016497,0.0001742247,0.0001420904,0.02129346,0.0002218874,0.9764998,0.001124954,0.000008276034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7915526,0.001070009,0.1443905,0.003675417,0.00007074187,0.00006500758,0.000582901,0.0002391084,0.05835365],"genre_scores_gemma":[0.9750366,0.0008272182,0.01741951,0.0002987549,0.0001783995,0.0001105375,0.0004409794,0.00008626061,0.00560174],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005298029,"threshold_uncertainty_score":0.01772362,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06927525957269225,"score_gpt":0.3334229529567652,"score_spread":0.264147693384073,"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."}}