{"paper":{"title":"Further results on the least Q-eigenvalue of a graph with fixed domination number","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guanglong Yu, Mingqing Zhai, Yarong Wu","submitted_at":"2018-12-21T03:52:06Z","abstract_excerpt":"In this paper, we proceed on determining the minimum $q_{min}$ among the connected nonbipartite graphs on $n\\geq 5$ vertices and with domination number $\\frac{n+1}{3}<\\gamma\\leq \\frac{n-1}{2}$. Further results obtained are as follows:\n  $\\mathrm{(i)}$ among all nonbipartite connected graph of order $n\\geq 5$ and with domination number $\\frac{n-1}{2}$, the minimum $q_{min}$ is completely determined;\n  $\\mathrm{(ii)}$ among all nonbipartite graphs of order $n\\geq 5$, with odd-girth $g_{o}\\leq5$ and domination number at least $\\frac{n+1}{3}<\\gamma\\leq \\frac{n-2}{2}$, the minimum $q_{min}$ is comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08932","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}