First Multiple Zagreb Calculator

product of squared degrees

CalculatorsFreeNo Signup
4.2(527 reviews)
All Tools

Loading tool...

About First Multiple Zagreb Calculator

A first multiplicative Zagreb calculator computing PM₁(G) = Π d(v)² over all vertices. Todeschini-Consonni (2010). Multiplicative analog of M₁ = Σd². PM₁ = (Πd)². More sensitive to degree distribution than additive M₁. Client-side.

First Multiple Zagreb Calculator Features

  • PM₁(G)
  • Π d²
  • Multiplicative
  • Todeschini '10
  • Common graphs
First multiplicative Zagreb PM₁(G) = Π d(v)² = (Π d(v))². Todeschini-Consonni (2010). Multiplicative version: replaces Σ with Π. PM₁ is more sensitive to outlier degrees: one vertex with d=1 makes PM₁ small regardless of other degrees.

How to Use

Select graph:

  • PM₁: Product of d²
  • vs M₁: Compare
  • log PM₁: Additive form

Log Connection

log(PM₁) = Σ log(d²) = 2Σlog(d). So log(PM₁)/2 = Σlog(d). The additive version of PM₁ is the sum of log-degrees. This connects multiplicative to additive theories via logarithms.

Sensitivity

M₁: one low-degree vertex adds small term. PM₁: one low-degree vertex MULTIPLIES by small factor → entire product shrinks. PM₁ is 'bottleneck-sensitive': weakest vertex determines scale.

Step-by-Step Instructions

  1. 1Select graph.
  2. 2Square each degree.
  3. 3Multiply all terms.
  4. 4Compare with M₁.
  5. 5Compute log PM₁.

First Multiple Zagreb Calculator — Frequently Asked Questions

PM₁ = (Πd)²?+

Yes! Π d² = (Πd)². The product of squares equals the square of the product. So PM₁ = (degree product)². One computation gives both.

PM₁ vs M₁ discrimination?+

PM₁ discriminates better in some cases. Two graphs with same M₁ can have different PM₁ because multiplication is more sensitive to distribution than addition.

PM₁ for special graphs?+

K_n: PM₁ = (n-1)^{2n}. C_n: PM₁ = 2^{2n} = 4ⁿ. Star: PM₁ = (n-1)² · 1^{2(n-1)} = (n-1)². Path: PM₁ = 1² · 2^{2(n-2)} · 1² = 4^{n-2}.

Share this tool: