First Zagreb Coindex Calculator

complement degree sum

CalculatorsFreeNo Signup
4.4(209 reviews)
All Tools

Loading tool...

About First Zagreb Coindex Calculator

A first Zagreb coindex calculator computing M̄₁(G) = Σ_{i≁j} (d(i)+d(j)). Došlić (2008). Sum of degree sums over non-edges (complement pairs). M̄₁ = 2m(n-1) - M₁. Elegant complement of first Zagreb. Client-side.

First Zagreb Coindex Calculator Features

  • M̄₁(G)
  • Non-edges
  • M̄₁+M₁
  • Complement
  • Common graphs
First Zagreb coindex M̄₁(G) = Σ (dᵢ+dⱼ) over non-adjacent pairs {i,j}. Došlić (2008). The 'missing edge' perspective. M̄₁ = 2m(n-1) - M₁. M̄₁(G) = M₁(Ḡ) where Ḡ is complement. Reveals what topology is NOT there.

How to Use

Select graph:

  • M̄₁: 1st coindex
  • Non-edges: Pairs
  • M̄₁+M₁: Verify

Complement View

M̄₁(G) = M₁(Ḡ): Zagreb coindex of G = Zagreb index of complement. For K_n: M̄₁=0 (no non-edges). For empty graph: M̄₁ = M₁ of K_n.

Key Identity

M̄₁ + M₁ = 2m(n-1). Total = index + coindex. Beautiful partition: every pair contributes to either M₁ (edges) or M̄₁ (non-edges), summing to 2m(n-1).

Step-by-Step Instructions

  1. 1Select graph.
  2. 2Find non-adjacent pairs.
  3. 3Sum (dᵢ+dⱼ) for each.
  4. 4Or: 2m(n-1) - M₁.
  5. 5Compare M₁ and M̄₁.

First Zagreb Coindex Calculator — Frequently Asked Questions

Why study what's missing?+

Non-edges reveal potential connections. In chemistry: where bonds COULD form. In networks: where links are absent. M̄₁ captures the 'opportunity cost' of the current topology.

M̄₁ = 0 when?+

M̄₁ = 0 ⟺ no non-edges ⟺ complete graph K_n. Everything is connected. No missing edges means no coindex contribution.

Computation shortcut?+

M̄₁ = 2m(n-1) - M₁. You never need to enumerate non-edges! Compute M₁ (O(n) via degree sequence) and subtract from 2m(n-1). Instant.

Share this tool: