{"id":"W2006666423","doi":"10.1016/j.laa.2006.05.020","title":"On the minimum rank of the join of graphs and decomposable graphs","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Join (topology); Cograph; Rank (graph theory); Graph product; Joins; Chordal graph; Tree-depth; Pathwidth; Indifference graph; Discrete mathematics; Graph; 1-planar graph; Line graph; Computer science","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.0002165142,0.000104088,0.0001537201,0.00005035794,0.0002574487,0.000009982108,0.000201168,0.00005166631,0.00002726456],"category_scores_gemma":[0.00004119231,0.00006138661,0.00007928642,0.0003905898,0.0002248408,0.00002754568,0.00004915312,0.00009923238,0.000003642311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001861688,"about_ca_system_score_gemma":0.00001129106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009824586,"about_ca_topic_score_gemma":0.00001141995,"domain_scores_codex":[0.9992867,0.00004884179,0.0002894227,0.0001574818,0.0001111675,0.0001064548],"domain_scores_gemma":[0.9985502,0.0007564615,0.0001725329,0.0004256552,0.00006700207,0.00002813032],"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.000005146821,0.0001352508,0.0002034735,0.00003686706,0.0000160749,1.395908e-8,0.00007558524,0.000002249005,0.007298922,0.9910241,0.001071289,0.0001309693],"study_design_scores_gemma":[0.0001827929,0.00001856757,0.001559974,0.00002029412,0.0000527797,0.000002224724,0.00008107804,0.000198962,0.02157336,0.9745776,0.001665146,0.00006721252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9937313,0.0002782549,0.00050049,0.001292453,0.00001131996,0.0007761869,0.000066449,0.00002447519,0.003319056],"genre_scores_gemma":[0.9986036,0.00006231439,0.0007197868,0.00008883137,0.00001346945,0.0001946654,0.000005599783,0.00001187842,0.0002998814],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01644655,"threshold_uncertainty_score":0.2503273,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01677410734487261,"score_gpt":0.2571638852250102,"score_spread":0.2403897778801375,"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."}}