trureturingGitHub MATHEMATICAL ATLAS

Combinatorics / CONCEPT

Increasing DomiRank entropy on connected nonregular graphs

DomiRank entropy can increase with competition on a connected nonregular simple graph. A six-vertex graph gives an exact entropy gap and a whole increasing interval; independent clones give the same behavior on 6m vertices for every positive integer m.

Closed Authored exposition
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES3
PROOF DEPTH3
DOCUMENT LINKS1
THEOREM

An exact pair, a whole interval, and independent clones

RELATIONSHIP ATLAS

Every connection, in context.

Explore in 3D
Direct recorded relationships
Proof dependencyStructural affinityDocument link

RELATED KNOWLEDGE

Structural connections

Documents & exposition

Other authored & advisory relationships

None recorded in this release.

LIBRARY / RELEASE VERSIONS

Content history

Loading release versions...
Browse the archive

Certified provenance

Exact release coordinate

Authority boundary

Dependency edges, status, and source coordinates come from the verified release and certified topology. Blueprint exposition is labeled separately. A fallback title carries no additional mathematical authority.