{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002902178,0.001114299,0.002427066,0.003828122,0.001692323,0.005295931,0.002056438,0.001497879,0.008947679],"category_scores_gemma":[0.0138356,0.0007945347,0.0009720271,0.003132974,0.003822849,0.01046339,0.002495276,0.003595925,0.001236687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001189375,"about_ca_system_score_gemma":0.0008107859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009963001,"about_ca_topic_score_gemma":0.001293775,"domain_scores_codex":[0.9979991,0.0007569678,0.00009498355,0.000389324,0.0004821598,0.0002774822],"domain_scores_gemma":[0.9825318,0.01109002,0.002095037,0.0009930602,0.001313476,0.001976616],"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.0002837911,0.0001044851,0.0010315,0.000202988,0.00003738396,0.0001004708,0.0005782622,0.006824413,0.002139023,0.9631091,0.004707915,0.02088063],"study_design_scores_gemma":[0.00002266348,0.00005558098,0.0005161871,0.0000237507,0.00001839277,0.0001087164,0.0002108177,0.01612073,0.0007031055,0.9805012,0.001694245,0.00002472394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.604736,0.004218256,0.311059,0.005192494,0.0005615465,0.00008417373,0.001634211,0.0006184527,0.07189576],"genre_scores_gemma":[0.9293092,0.002407838,0.04752653,0.0004964264,0.001615824,0.0001086896,0.00165232,0.0003217049,0.01656143],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008947679,"threshold_uncertainty_score":0.02993292,"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."}}