Second Multiple Zagreb Calculator

product of edge degree products

CalculatorsFreeNo Signup
4.6(539 reviews)
All Tools

Loading tool...

About Second Multiple Zagreb Calculator

A second multiplicative Zagreb calculator computing PM₂(G) = Π dᵢ·dⱼ over edges. Todeschini-Consonni (2010). Multiplicative analog of M₂ = Σdd. PM₂ = product of edge-endpoint degree products. Extremely sensitive to individual edge contributions. Client-side.

Second Multiple Zagreb Calculator Features

  • PM₂(G)
  • Π dd
  • Multiplicative
  • Todeschini '10
  • Common graphs
Second multiplicative Zagreb PM₂(G) = Π dᵢ·dⱼ over edges. Todeschini-Consonni (2010). Edge-based multiplicative: each edge contributes its degree product to the overall product. One pendant edge (dd=d·1=d) can dramatically affect PM₂.

How to Use

Select graph:

  • PM₂: Product of dd
  • vs M₂: Compare
  • log PM₂: = Σlog(dd)

Additive Form

log(PM₂) = Σ log(dᵢ·dⱼ) = Σ [log(dᵢ)+log(dⱼ)]. The additive version is the sum of log-products over edges. Connects to M₂ through logarithmic transformation.

Bounds

For d-regular: PM₂ = (d²)^m = d^{2m}. For star: PM₂ = ((n-1)·1)^{n-1} = (n-1)^{n-1}. Path: PM₂ = 2·4^{n-3}·2 = 4^{n-2}.

Step-by-Step Instructions

  1. 1Select graph.
  2. 2For each edge: dᵢ·dⱼ.
  3. 3Multiply all terms.
  4. 4Compare with M₂.
  5. 5Compute log PM₂.

Second Multiple Zagreb Calculator — Frequently Asked Questions

PM₂ vs PM₁?+

PM₁ = Π d² (vertex-based). PM₂ = Π dd (edge-based). Different summation domains. PM₁ counts each vertex once. PM₂ counts each edge once. For trees: PM₁ and PM₂ are related but different.

Overflow risk?+

PM₂ grows exponentially! K_5: PM₂ = 4^10 ≈ 10⁶. K_10: PM₂ = 9^45 ≈ 10⁴³. For practical computation: use log(PM₂) = Σlog(dᵢ·dⱼ) to avoid overflow.

PM₂ = 0?+

PM₂ = 0 iff some d·d = 0 iff some vertex has degree 0. Isolated vertices kill PM₂. For connected graphs: PM₂ > 0 always.

Share this tool: