{"id":"W4415556773","doi":"10.61091/jcmcc128-07","title":"Cut vertex and unicyclic graphs with the maximum number of connected induced subgraphs","year":2025,"lang":"","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Wiener index; Connectivity; Graph; Vertex (graph theory); Real number; Topological index","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007786508,0.0006540658,0.0006513306,0.001814548,0.0007948042,0.0014863,0.001151372,0.0008400201,0.005745284],"category_scores_gemma":[0.007365686,0.0004461871,0.0006343654,0.002250548,0.0009395731,0.001954189,0.0009184014,0.0006550046,0.0005346169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001062811,"about_ca_system_score_gemma":0.0006901596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00130778,"about_ca_topic_score_gemma":0.002095821,"domain_scores_codex":[0.9990609,0.0002291619,0.00005740538,0.0002531255,0.0001940607,0.0002053741],"domain_scores_gemma":[0.9940706,0.003040069,0.001032097,0.0006069348,0.00059224,0.0006579694],"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.0009462432,0.0002359236,0.01623345,0.001591784,0.0002270389,0.001148896,0.0008186909,0.22286,0.03375427,0.545934,0.02429464,0.1519551],"study_design_scores_gemma":[0.0001295576,0.0005347357,0.01483112,0.0002616291,0.0002583959,0.0038409,0.0007927543,0.4098351,0.01810929,0.5225747,0.02871594,0.0001158681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6581607,0.002458564,0.2816808,0.001110133,0.00009539764,0.0002719676,0.004173507,0.000860641,0.05118833],"genre_scores_gemma":[0.9125896,0.001025567,0.07622451,0.0002177233,0.00009424312,0.0002300452,0.002229035,0.0002038117,0.00718566],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005745284,"threshold_uncertainty_score":0.01921993,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0140703795903176,"score_gpt":0.2755205080906672,"score_spread":0.2614501285003496,"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."}}