{"paper":{"title":"Irregularity of Graphs respecting Degree Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Florian Werner","submitted_at":"2023-03-22T15:14:56Z","abstract_excerpt":"Albertson defined the irregularity of a graph $G$ as $irr(G)=\\sum\\limits_{uv\\in E(G)}|d_G(u)-d_G(v)|$. For a graph $G$ with $n$ vertices, $m$ edges, maximum degree $\\Delta$, and $d=\\left\\lfloor \\frac{\\Delta m}{\\Delta n-m}\\right\\rfloor$, we show $$irr(G)\\leq d(d+1)n+\\frac{1}{\\Delta}\\left(\\Delta^2-(2d+1)\\Delta-d^2-d\\right)m.$$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.12632","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.12632/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"}