{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003294005,0.00209355,0.001941052,0.005097446,0.001576047,0.004768852,0.004360334,0.002346562,0.007350745],"category_scores_gemma":[0.02443576,0.0007706055,0.001123731,0.002531736,0.004756191,0.009598725,0.004195202,0.007272094,0.00173011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003181248,"about_ca_system_score_gemma":0.001161605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007376701,"about_ca_topic_score_gemma":0.001124895,"domain_scores_codex":[0.9982797,0.0003992395,0.00008304537,0.0003122601,0.0006745585,0.0002512824],"domain_scores_gemma":[0.9743395,0.01735566,0.001505768,0.001984848,0.002138548,0.002675618],"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.0004321162,0.0001475605,0.001648006,0.0003534048,0.00006583222,0.0003079977,0.0004542644,0.01760235,0.0106665,0.9383705,0.009318514,0.02063296],"study_design_scores_gemma":[0.00003173397,0.00008019667,0.001148943,0.0001222673,0.0000632619,0.0003053333,0.0001102824,0.1141378,0.002828033,0.8773068,0.003803612,0.00006162858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2915323,0.01018276,0.4803808,0.01154716,0.002072798,0.00009640238,0.001301683,0.001493395,0.2013927],"genre_scores_gemma":[0.9119196,0.005788569,0.05224199,0.001238857,0.002677548,0.0002613781,0.0009899816,0.001097082,0.02378502],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007350745,"threshold_uncertainty_score":0.02459067,"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."}}