Proofs of Nath–Fasfous–Das–Shang's commuting and surface conjectures, and a sharp form of Tak–Dutta–Nath's clique theorem

For Nath–Fasfous–Das–Shang's Conjectures 1–3 (Symmetry 13 (2021), 1651, Section 4, p. 11), we prove the surface and commuting-graph statements and give an alternative proof with exact equality cases for Tak–Dutta–Nath's prior clique result (arXiv:2605.22160v1 (2026), Theorem 5.4, pp. 14–15). Every planar or toroidal graph is non-CN-hyperenergetic. For every finite nonabelian group, its noncentral commuting graph satisfies E_CN ≤ n(n-z-2) < 2(n-1)(n-2), where n counts noncentral elements and z counts central elements; the same bound holds for every finite noncommutative ring, without an identity assumption. The group argument combines the published estimate E_CN ≤ 4m with a proper-centralizer count. A neighborhood-clique decomposition proves the surface statement. For a union of cliques, equality with the complete-graph benchmark occurs exactly for one clique or two isolated vertices.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-20
DOI
https://doi.org/10.5281/zenodo.24398995
Primary Topic
Graph theory and applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Proofs of Nath–Fasfous–Das–Shang's commuting and surface conjectures, and a sharp form of Tak–Dutta–Nath's clique theorem

Wenlin Zhang, Haobo Ma
Zenodo (CERN European Organization for Nuclear Research)
Graph theory and applications
preprint

Proofs of Nath–Fasfous–Das–Shang's commuting and surface conjectures, and a sharp form of Tak–Dutta–Nath's clique theorem

Wenlin Zhang, Haobo Ma
preprint en

Abstract

For Nath–Fasfous–Das–Shang's Conjectures 1–3 (Symmetry 13 (2021), 1651, Section 4, p. 11), we prove the surface and commuting-graph statements and give an alternative proof with exact equality cases for Tak–Dutta–Nath's prior clique result (arXiv:2605.22160v1 (2026), Theorem 5.4, pp. 14–15). Every planar or toroidal graph is non-CN-hyperenergetic. For every finite nonabelian group, its noncentral commuting graph satisfies E_CN ≤ n(n-z-2) < 2(n-1)(n-2), where n counts noncentral elements and z counts central elements; the same bound holds for every finite noncommutative ring, without an identity assumption. The group argument combines the published estimate E_CN ≤ 4m with a proper-centralizer count. A neighborhood-clique decomposition proves the surface statement. For a union of cliques, equality with the complete-graph benchmark occurs exactly for one clique or two isolated vertices.

Zenodo (CERN European Organization for Nuclear Research)
National University of Singapore (SG)
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon