{"id":"W1498810156","doi":"10.37236/434","title":"The Orderings of Bicyclic Graphs and Connected Graphs by Algebraic Connectivity","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China; Hong Kong Baptist University; Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Mathematics; Combinatorics; Algebraic connectivity; Chordal graph; Indifference graph; Algebraic number; Laplacian matrix; Pathwidth; Discrete mathematics; 1-planar graph; Graph; Metric dimension; Eigenvalues and eigenvectors; Connectivity; Line graph; Physics","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.0002461129,0.0003510637,0.0002430866,0.002517201,0.0008626201,0.001304731,0.0003211841,0.0002983135,0.002427242],"category_scores_gemma":[0.002323147,0.0002631199,0.0002301268,0.001949164,0.001977724,0.001885835,0.0008192565,0.0006199746,0.0001753689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006296944,"about_ca_system_score_gemma":0.0004598483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002172875,"about_ca_topic_score_gemma":0.003715541,"domain_scores_codex":[0.9996299,0.00007210274,0.00002530829,0.00008635552,0.0001130827,0.00007331673],"domain_scores_gemma":[0.9980451,0.000696103,0.0005017755,0.0001988354,0.0002726218,0.0002856281],"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.0001076545,0.00003577094,0.004776546,0.0001218379,0.00001300673,0.000242618,0.0009590263,0.0091753,0.007666235,0.9404207,0.002399943,0.03408137],"study_design_scores_gemma":[0.00002867752,0.00006602939,0.007093695,0.00006397151,0.00002647789,0.0006308568,0.0007966096,0.02578349,0.004449872,0.9463797,0.01462688,0.00005379143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8635864,0.001387861,0.07372621,0.0006033629,0.0000658609,0.00007937496,0.0006998649,0.0001433333,0.05970778],"genre_scores_gemma":[0.9743936,0.0008320202,0.02097103,0.0001060122,0.0000894941,0.00005207888,0.0005738057,0.00003498659,0.002946973],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002517201,"threshold_uncertainty_score":0.008119941,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006625972996884825,"score_gpt":0.2496553177340856,"score_spread":0.2430293447372008,"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."}}