{"id":"W2115358815","doi":"10.1002/qua.24252","title":"The number of spanning trees in an (<i>r</i>, <i>s</i>)‐semiregular graph and its line graph","year":2012,"lang":"en","type":"article","venue":"International Journal of Quantum Chemistry","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Spanning tree; Combinatorics; Line graph; Graph factorization; Cubic graph; Mathematics; Discrete mathematics; Factor-critical graph; Trémaux tree; Minimum spanning tree; Voltage graph; Mathematical proof; Minimum degree spanning tree; Graph; Pathwidth","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.000345754,0.0002103643,0.000244538,0.001168678,0.0004079502,0.0006779152,0.0005318695,0.0003957289,0.002906057],"category_scores_gemma":[0.001512081,0.0001498371,0.000255832,0.0006507954,0.0008463395,0.001563759,0.0004493395,0.0004571052,0.0002603053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004720924,"about_ca_system_score_gemma":0.0001656324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003487346,"about_ca_topic_score_gemma":0.0003411144,"domain_scores_codex":[0.9997676,0.00005452088,0.00001881724,0.00006693193,0.00005688512,0.00003524957],"domain_scores_gemma":[0.9984431,0.0006324059,0.0003675251,0.0001256426,0.0002196485,0.0002117933],"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.0002010722,0.00007102323,0.007920793,0.0002009131,0.00004360293,0.0003498878,0.0004397198,0.01609257,0.03263032,0.9003972,0.004781512,0.03687127],"study_design_scores_gemma":[0.00003290343,0.0001633451,0.009037487,0.00005208331,0.00004707704,0.001263693,0.0003921262,0.1845827,0.01697793,0.7795045,0.007890071,0.00005611845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8294818,0.0005168316,0.1527441,0.0004284092,0.00007516747,0.00002335224,0.0004230177,0.0002049204,0.01610242],"genre_scores_gemma":[0.9743352,0.0002675529,0.02297191,0.00006901286,0.00005916802,0.00003888865,0.0002071971,0.00004134716,0.002009847],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002906057,"threshold_uncertainty_score":0.009721696,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03599614359662989,"score_gpt":0.347741997947168,"score_spread":0.3117458543505381,"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."}}