{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002134932,0.000160496,0.0002975638,0.00008657202,0.0004136353,0.00003713258,0.000573407,0.00008735374,0.000009563561],"category_scores_gemma":[0.0006534941,0.00009317643,0.0001447033,0.000588638,0.0004394268,0.00009421023,0.00005203777,0.001062181,7.694227e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002179997,"about_ca_system_score_gemma":0.0001216617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007075556,"about_ca_topic_score_gemma":0.0000233887,"domain_scores_codex":[0.9985921,0.0001691363,0.0004658629,0.0001078272,0.0002773469,0.0003877104],"domain_scores_gemma":[0.9960799,0.002490144,0.000687818,0.0003971333,0.0002704265,0.00007462622],"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.00004104333,0.0001463101,0.0002329055,0.00001193139,0.0001266,3.402833e-7,0.0002458816,1.191162e-7,0.021911,0.9761478,0.0008171256,0.00031894],"study_design_scores_gemma":[0.0006456913,0.0002338382,0.0003054518,0.00001083027,0.0001066315,0.0001170339,0.0001705069,0.00001384893,0.01386833,0.9813197,0.003105406,0.0001027011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9959312,0.001452252,0.0004326826,0.00155192,0.0001794215,0.000206313,0.000002864705,0.00002154981,0.0002218054],"genre_scores_gemma":[0.999037,0.0007847546,0.00001479687,0.00003559449,0.00001241839,0.000008887816,4.504937e-7,0.00002113513,0.00008490518],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008042678,"threshold_uncertainty_score":0.4614707,"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."}}