{"id":"W2400938207","doi":"","title":"Sharp Bounds for Spectral Radius of Graphs Presented by K-Neighbour of the Vertices","year":2016,"lang":"en","type":"article","venue":"Advances in natural science/Advances in natural sciences","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Spectral radius; Mathematics; Eigenvalues and eigenvectors; Integer (computer science); Graph; Upper and lower bounds; Sequence (biology); RADIUS; Connectivity; Simple (philosophy); Discrete mathematics; Simple graph; Physics; Mathematical analysis; Computer science; Quantum mechanics","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.002196572,0.001785837,0.001309979,0.003580724,0.001346007,0.002442948,0.002952474,0.001666588,0.005496247],"category_scores_gemma":[0.02688118,0.0007153244,0.001016552,0.001875799,0.003327382,0.005797327,0.003681264,0.003060695,0.001596541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001361076,"about_ca_system_score_gemma":0.0005047284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007286994,"about_ca_topic_score_gemma":0.0009070691,"domain_scores_codex":[0.9975801,0.0007607452,0.00009511424,0.0005819975,0.0004915175,0.0004905242],"domain_scores_gemma":[0.9819437,0.01221852,0.0015112,0.001516241,0.001144155,0.001666226],"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.001442266,0.0002369424,0.007295519,0.001718564,0.0003049073,0.001060966,0.001856902,0.131736,0.05208701,0.730719,0.01844482,0.05309705],"study_design_scores_gemma":[0.00006613666,0.0003525164,0.006224211,0.0003662264,0.000230091,0.001605976,0.0006908937,0.4237842,0.01623632,0.5379032,0.01230653,0.0002338042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2896962,0.01710831,0.629799,0.003309499,0.0006022127,0.0001375835,0.001140091,0.001448518,0.05675866],"genre_scores_gemma":[0.9242816,0.004187074,0.06590337,0.000639154,0.0005855007,0.000237002,0.0005530994,0.000279507,0.003333681],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005496247,"threshold_uncertainty_score":0.01838672,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005616565907139849,"score_gpt":0.2820546128543018,"score_spread":0.276438046947162,"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."}}