{"id":"W2021533461","doi":"10.1016/j.dam.2009.06.023","title":"Bounds on the index of the signless Laplacian of a graph","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":50,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Adjacency matrix; Diagonal matrix; Distance matrix; Simple graph; Bound graph; Degree matrix; Graph; Diagonal; Connectivity; Upper and lower bounds; Laplacian matrix; Laplace operator; Discrete mathematics; Graph power; Line 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005557075,0.000206053,0.0003541364,0.00006569384,0.0001884815,0.00001929275,0.0007290948,0.00009526491,0.00004464396],"category_scores_gemma":[0.0001162524,0.0001098717,0.0002225743,0.0005257641,0.0003109165,0.00002426764,0.00006243277,0.0002177428,0.000008217869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001053866,"about_ca_system_score_gemma":0.000026408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001121967,"about_ca_topic_score_gemma":0.000003204896,"domain_scores_codex":[0.9986373,0.00004010996,0.0005417942,0.0001671955,0.0004026964,0.0002109714],"domain_scores_gemma":[0.9974834,0.0007600628,0.0005097599,0.001149919,0.00005698479,0.00003992322],"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.00001659819,0.0002789817,0.00001303645,0.0001015694,0.00003860539,1.101965e-7,0.001826855,0.000012046,0.008505768,0.9884322,0.0005259516,0.0002482219],"study_design_scores_gemma":[0.0002025343,0.00003796798,0.0002237317,0.00009906184,0.00007309022,0.000001631641,0.001455861,0.000114862,0.03292374,0.9646162,0.000129735,0.0001215585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8720897,0.00001804933,0.01269986,0.001354096,0.00004382579,0.001498801,0.0000580229,0.00007728286,0.1121604],"genre_scores_gemma":[0.9965162,0.000004097477,0.003037418,0.0001988204,0.00001927992,0.00006987727,0.00000222935,0.0000227577,0.0001293314],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1244265,"threshold_uncertainty_score":0.4480436,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0261931885729084,"score_gpt":0.2752893651765035,"score_spread":0.2490961766035951,"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."}}