---
title: 'M-Polynomial: Graph Invariants'
url: https://www.emergentmind.com/topics/m-polynomial-9b8dfd46-a81c-40f9-8df3-41e9b55cb514
type: topic
---

# M-Polynomial: Graph Invariants

The $M$-polynomial is a bivariate graph polynomial that encodes the complete degree–pair distribution of edge endpoints in a graph. Introduced by Deutsch and Klavžar in 2015, it serves as a universal generating function for a broad class of degree-based topological indices, which are key tools in chemical graph theory, combinatorics, and network analysis. The $M$-polynomial admits closed forms for many important graph families and interacts systematically with graph operations such as products, making it an essential algebraic invariant for both theoretical and applied research.

## 1. Definition and Structural Properties

Let $G=(V,E)$ be a finite simple graph, and for integers $i,j\geq1$, denote
\[
m_{ij}(G) = \#\bigl\{ uv\in E : \{\deg(u),\deg(v)\}=\{i,j\} \bigr\},
\]
the number of edges whose endpoints have degrees $i$ and $j$. The $M$-polynomial of $G$ is
\[
M(G;x,y) = \sum_{i\leq j} m_{ij}(G)\, x^i y^j.
\]
This bivariate generating function is symmetric in $i$ and $j$ and encodes all bond degree incidence information. The total edge count is recovered as $|E(G)| = \sum_{i\leq j} m_{ij}(G)$. If the graph has maximal degree $\Delta$, then $m_{ij}(G)=0$ for $\max\{i,j\} > \Delta$ [1407.1592].

## 2. From $M$-Polynomial to Degree-Based Indices

Most degree-based topological indices—quantities originally motivated by mathematical chemistry for correlating molecular structure with physical or chemical properties—admit the general form
\[
I(G) = \sum_{uv\in E} f(\deg(u),\deg(v)),
\]
where $f$ is a function of the endpoint degrees. The $M$-polynomial method expresses $I(G)$ as
\[
I(G) = \sum_{i\leq j} m_{ij}(G)\,f(i,j),
\]
and, for polynomial $f$, as the evaluation of a corresponding operator combination at $x=y=1$. The main differential and integral operators are as follows:

| Operator        | Action                                                      | Typical Use   |
|-----------------|------------------------------------------------------------|---------------|
| $D_x$           | $x\,\frac{\partial}{\partial x}$                            | Differentiation in $x$   |
| $D_y$           | $y\,\frac{\partial}{\partial y}$                            | Differentiation in $y$   |
| $S_x$           | $\int_0^x \frac{f(t,y)}{t}\,dt$                            | Inverse powers (integral transform) |
| $S_y$           | $\int_0^y \frac{f(x,t)}{t}\,dt$                            | "             |
| $J$             | $f(x,x)$                                                    | Symmetrization for indices depending on $d(u)+d(v)$ or similar |
| $Q_\alpha$      | $x^\alpha f(x,y)$                                           | Scalar transformation    |

Degree-based indices computed from $M(G;x,y)$ via operators include:

- First Zagreb index: $M_1(G)=(D_x+D_y)M(G;x,y)\big|_{x=y=1}$
- Second Zagreb index: $M_2(G)=D_x D_y M(G;x,y)\big|_{x=y=1}$
- General Randić index: $R_\alpha(G)=D_x^{\alpha} D_y^{\alpha} M(G;x,y)\big|_{x=y=1}$
- Symmetric division index: $\mathrm{SDD}(G)=(D_x S_y + D_y S_x)M(G;x,y)\big|_{x=y=1}$
- Harmonic and inverse sum indices: use combinations of $S_x$, $J$, $Q_\alpha$, $D_x D_y$ [1407.1592, 1806.08183, 2511.12587, 1708.08207].

This formalism enables the simultaneous and systematic computation of a large class of invariants, replacing traditional edgewise enumeration or index-specific counting.

## 3. Explicit Computation: Examples and Methods

Closed-form $M$-polynomials have been obtained for key graph families via combinatorial, recursive, and linear-algebraic techniques:

- **Generalized Möbius Ladder** $M_{m,n}$: Partitioning edges by boundary/interior type leads to
  \[
  M(M_{m,n};x,y) = 2(m-1)x^3y^3 + 2(m-1)x^3y^4 + (m-1)(2n-5)x^4y^4
  \]
  The line graph $L(M_{m,n})$ yields a bivariate polynomial in four monomials centered at degrees 4, 5, 6 [1708.08207].

- **Bethe Cacti** $D_n$, $C_n$, $E_n$: Recursive construction allows closed $M$-polynomials based on counting by degree class [1806.08183].

- **Generalized Hanoi Graphs** $H_p^n$: Occupancy-based combinatorial decomposition, refined with Stirling and 2-associated Stirling numbers, enables an explicit bivariate $M$-polynomial as a sum of diagonal and off-diagonal monomials in the possible degree classes [2511.12587].

- **Product Graphs**: Systematic formulas for the $M$-polynomial under Cartesian, direct, strong, lexicographic, and Sierpiński products follow from degree formulas and double-index sums involving the $m_{i,j}$ values of the factors, greatly generalizing structural results [2603.10596].

- **Gutman's Approach**: For bounded-degree planar graphs, $m_{i,j}$ are determined by solving linear equations derived from vertex and edge counts, possibly extended by Euler's formula for faces [1806.08183].

## 4. Algorithmic and Computational Significance

Once $M(G;x,y)$ is determined, all degree-based indices are computed by low-order differentiation/integration and evaluation at $(x,y)=(1,1)$. For highly regular or recursively defined graphs, the number of distinct $m_{ij}$ is small, yielding swift computation and compact closed forms across parameter ranges [1708.08207, 2511.12587].

The method dramatically reduces complexity from $O(|E|)$ per invariant (using edgewise summation) to $O(1)$ symbolic operations after the initial degree-pair count, with particular efficiency for large parametric chemical graph families and regular graph constructions [2602.15086].

## 5. The $M$-Polynomial and Emerging Indices

The $M$-polynomial framework extends to new families of topological indices. For example, the hyperbolic Sombor index (HSO) is derived by composing operators in sequence:
\[
HSO(G) = \left[D_x^{1/2} J\,P_y\,P_x\,S_x\left(M(G;x,y)\right)\right]_{x=1}
\]
where $S_x$, $P_x$, $P_y$, $J$, and $D_x^{1/2}$ act as defined in the associated data. Detailed formulas are provided for standard graphs such as paths, cycles, stars, and for chemical families with tabulated and graphical sensitivity to parameters [2602.15086].

This suggests a unifying algebraic pipeline for the adaptation and computation of newly proposed degree-based indices, leveraging the operator calculus on $M(G;x,y)$.

## 6. Applications, Structural Insight, and Outlook

Degree-based indices extracted via $M$-polynomial methods are fundamental in correlating graph structure to molecular properties such as boiling point, stability, and reactivity in mathematical chemistry. The support (i.e., which degree-pairs occur) of $M(G;x,y)$ itself reveals structural regularity, degree heterogeneity, and edge-type dominance.

Having explicit $M$-polynomials enables immediate access to the full hierarchy of classical and exotic indices for new graph constructions, provides universal structural parameters for benchmarking and invariance, and allows the study of parametric families across discrete and continuous variables. The computational paradigm and algebraic operator calculus of $M$-polynomials unify and extend formerly disparate methods in chemical graph theory, combinatorics, and applied network analysis [1407.1592, 1708.08207, 2511.12587, 2603.10596].

The $M$-polynomial continues to be generalized, including matrix-valued (finite biorthogonal $M$-matrix) analogues admitting explicit generating functions, recurrence, biorthogonality relations, and matrix differential equations, widening its reach in algebraic and spectral graph theory [2509.05817].

## 7. References

- "M-Polynomial and Degree-Based Topological Indices" [1407.1592]
- "The $M$-Polynomial and Topological Indices of Generalized Möbius Ladder and Its Line Graph" [1708.08207]
- "M-Polynomial Revisited: Bethe Cacti and an Extension of Gutman's Approach" [1806.08183]
- "Explicit M-Polynomial and Degree-Based Topological Indices of Generalized Hanoi Graphs" [2511.12587]
- "M-Polynomial Based Mathematical Formulation of the Hyperbolic Sombor Index" [2602.15086]
- "M-Polynomial of Product Graphs" [2603.10596]
- "Finite biorthogonal M matrix polynomials" [2509.05817]

Source: https://www.emergentmind.com/topics/m-polynomial-9b8dfd46-a81c-40f9-8df3-41e9b55cb514