{"id":"W2070458953","doi":"10.1016/s0166-218x(02)00572-3","title":"Bounds on the average connectivity of a graph","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Discrete mathematics; Planar graph; Disjoint sets; Cograph; Graph; Clique number; Upper and lower bounds; Split graph; Cartesian product; 1-planar graph; Chordal graph","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.003821398,0.002255867,0.002636145,0.005685395,0.002192711,0.004944968,0.00431392,0.002832923,0.01109816],"category_scores_gemma":[0.0407037,0.00120403,0.001461541,0.005153339,0.003927615,0.01104675,0.003907165,0.005688086,0.001191413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003263769,"about_ca_system_score_gemma":0.0009449683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00200716,"about_ca_topic_score_gemma":0.002639321,"domain_scores_codex":[0.9972093,0.0007390552,0.0001128982,0.000729253,0.0007342146,0.0004753305],"domain_scores_gemma":[0.9148856,0.0707102,0.003285832,0.004575517,0.00368763,0.002855191],"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.000919098,0.0001839066,0.004807671,0.001110857,0.0003070398,0.0004406551,0.0008903451,0.2796127,0.01305845,0.6206638,0.01561242,0.06239298],"study_design_scores_gemma":[0.00005485401,0.0001610171,0.002602657,0.0001758683,0.0001587885,0.0003816406,0.0001661613,0.4311795,0.003204547,0.5571088,0.004736783,0.00006935102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2630473,0.01588283,0.6368172,0.01196737,0.0007910648,0.0000975462,0.002951487,0.002478027,0.06596724],"genre_scores_gemma":[0.9371758,0.008164917,0.04237354,0.001022588,0.001732282,0.0003374626,0.001917712,0.0008782763,0.006397352],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01109816,"threshold_uncertainty_score":0.03712702,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01803764479792878,"score_gpt":0.2266575634988209,"score_spread":0.2086199187008921,"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."}}