OurBigBook About$ Donate
 Sign in Sign up

Centered four-cycle identity for a biregular graph (t4​(G)=δ4+n−4tr((HHT)2))

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Graph theory Bipartite graph Biregular graph Quasirandom bipartite graph
2026-10-06  0 By others on same topic  0 Discussions Create my own version
For an equal-part biregular graph with part size n and degree δn, let M be its biadjacency matrix and H=M−δJ, where J is the all-ones matrix. The constant row and column sums make H annihilate constants on both sides. Since MMT=δ2nJ+HHT and the two summands have zero products, their squared matrix trace splits as displayed. The bipartite four-cycle density counts the squared matrix trace of MMT divided by n4.

 Ancestors (8)

  1. Quasirandom bipartite graph
  2. Biregular graph
  3. Bipartite graph
  4. Graph theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 12 / 6 / Solution
  • Spectral discrepancy bound for a biregular graph

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook