{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007524959,0.0001037956,0.000168352,0.00004821431,0.00005162403,0.00002660046,0.0003935778,0.00006116193,0.00003534382],"category_scores_gemma":[0.0002074208,0.00007681686,0.0001026005,0.0001143246,0.00009817208,0.000245809,0.0000442781,0.0002180833,8.461402e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001540631,"about_ca_system_score_gemma":0.00002151876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001838494,"about_ca_topic_score_gemma":0.000001309931,"domain_scores_codex":[0.998904,0.00003927193,0.0005200495,0.00007580511,0.0003137708,0.0001470899],"domain_scores_gemma":[0.9986631,0.0003608409,0.0004756162,0.0001312461,0.0002784469,0.00009080442],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002324023,0.0008218464,0.03588686,0.00006642182,0.0002617595,0.00001629325,0.001247218,0.00003848317,0.5301325,0.4298993,0.0002876397,0.001109253],"study_design_scores_gemma":[0.0008246312,0.00002293432,0.004588012,0.0002511831,0.00005475094,0.0005151983,0.0009169425,0.000302636,0.3139667,0.6777464,0.0006428128,0.000167749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9980448,0.0007087574,0.0003384727,0.0003905551,0.0001270519,0.0000367206,0.00001103811,0.000006429473,0.0003361239],"genre_scores_gemma":[0.9989961,0.0001757953,0.0005043012,0.00002512899,0.0002209548,0.000004321002,0.000002599542,0.00001180181,0.00005893744],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2478471,"threshold_uncertainty_score":0.3132501,"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."}}