{"paper":{"title":"5-regular oriented graphs with optimum skew energy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lifeng Guo, Ligong Wang, Peng Xiao","submitted_at":"2016-03-14T14:41:53Z","abstract_excerpt":"Let $G$ be a simple undirected graph and $G^\\sigma$ be the corresponding oriented graph of $G$ with the orientation $\\sigma$. The skew energy of $G^\\sigma$, denoted by $\\varepsilon_s(G^\\sigma)$, is defined as the sum of the singular values of the skew adjacency matrix $S(G^\\sigma)$. In 2010, Adiga et al. certified that $\\varepsilon_s(G^\\sigma) \\leq n\\sqrt{\\Delta}$, where $\\Delta$ is the maximum degree of $G$ of order $n$. In this paper, we determine all connected 5-regular oriented graphs of order $n$ with maximum skew-energy."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04280","kind":"arxiv","version":1},"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"}