{"id":"W4400512486","doi":"10.61091/ars159-15","title":"Sharp Upper Bound for Harmonic Index of Trees with Given Total Domination Number","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Universiti Malaysia Terengganu; Universiti Sains Malaysia","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Vertex (graph theory); Graph; Connectivity; Bound graph; Simple graph; Harmonic mean; Topological index; Discrete mathematics; Mathematical analysis; Geometry; Graph power; Line graph","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.000750961,0.0004516467,0.0009089975,0.002210243,0.00119037,0.002123201,0.001466415,0.0008501196,0.004728394],"category_scores_gemma":[0.005004449,0.0003094312,0.0004780664,0.001326416,0.001316581,0.002648854,0.001801961,0.001331882,0.0004377959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00148424,"about_ca_system_score_gemma":0.000412168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006741799,"about_ca_topic_score_gemma":0.00119018,"domain_scores_codex":[0.9993126,0.00009147296,0.00002303832,0.0001497713,0.0002002352,0.0002228914],"domain_scores_gemma":[0.9973747,0.001624892,0.0001627527,0.0002362043,0.0002248737,0.0003766296],"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.0003551806,0.0001021204,0.006305341,0.0003621963,0.00008133891,0.0004618559,0.0007019999,0.03881782,0.02754852,0.8870122,0.006322866,0.03192836],"study_design_scores_gemma":[0.00002812899,0.00007660557,0.00468648,0.00008081244,0.00006341517,0.0006626727,0.0002449906,0.2069635,0.008134609,0.772076,0.006914081,0.00006887375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7180622,0.003670485,0.183926,0.00133181,0.0001609769,0.00006473016,0.001196129,0.000372722,0.09121498],"genre_scores_gemma":[0.9778543,0.0008464425,0.01561578,0.0001538879,0.0001655031,0.0000605944,0.0004604871,0.0001084452,0.004734406],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004728394,"threshold_uncertainty_score":0.01581812,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01818324707929703,"score_gpt":0.2929142758212924,"score_spread":0.2747310287419953,"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."}}