{"id":"W2963002481","doi":"","title":"Lower bounds for algebraic connectivity of graphs in terms of matching number or edge covering number.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Algebraic connectivity; Matching (statistics); Algebraic number; Enhanced Data Rates for GSM Evolution; Upper and lower bounds; Discrete mathematics; Graph; Connectivity; Line graph; Computer science; Statistics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005080677,0.0001363528,0.0003427842,0.00005215677,0.00005884403,0.000008743208,0.0002084011,0.00008896604,0.0001250884],"category_scores_gemma":[0.0002914554,0.0001001301,0.0001291569,0.0002509524,0.0001171708,0.0001495859,0.00005934242,0.00007230667,0.00000981466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003034766,"about_ca_system_score_gemma":0.00002596042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001910527,"about_ca_topic_score_gemma":0.00002757527,"domain_scores_codex":[0.9990245,0.00005674887,0.0003888291,0.0001983111,0.0001229896,0.0002086904],"domain_scores_gemma":[0.9976987,0.001583492,0.0002301894,0.000385284,0.00005923916,0.00004314884],"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.0001069481,0.0004032041,0.01961084,0.0001502697,0.00003661524,9.506808e-7,0.000310586,1.768382e-7,0.007989457,0.9708223,0.0002584252,0.0003101826],"study_design_scores_gemma":[0.001457363,0.00005226586,0.003398342,0.00019312,0.00002295684,0.000004204656,0.00004575671,0.0000037679,0.01572308,0.9787857,0.0001764688,0.0001369947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9959838,0.000002915734,0.0005060136,0.00005809871,0.0003510173,0.0003847129,0.00003710548,0.00003386271,0.002642448],"genre_scores_gemma":[0.9988211,0.000005654017,0.0008345222,0.0000123882,0.000004170102,0.0001002856,0.000001556382,0.00002714765,0.000193131],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0162125,"threshold_uncertainty_score":0.4083188,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02384066670819115,"score_gpt":0.305320340464497,"score_spread":0.2814796737563058,"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."}}