Emeric Deutsch

activity

20022021

most citedM-Polynomial and Degree-Based Topological Indices

81 citations · 137 across the 20 of their papers we have counts for

collaborators

22 papers

math.CO2021★ 1 cited

The degree of asymmetry of sequences

Sergi Elizalde, Emeric Deutsch

We explore the notion of degree of asymmetry for integer sequences and related combinatorial objects. The degree of asymmetry is a new combinatorial statistic that measures how far…

math.CO2018

M-Polynomial Revisited: Bethe Cacti and an Extension of Gutman's Approach

Emeric Deutsch, Sandi Klavžar

The $M$ -polynomial of a graph $G$ is defined as $\sum_{i \leq j} m_{i, j} (G) x^{i} y^{j}$ , where $m_{i, j} (G)$ , $i, j \geq 1$ , is the number of edges $uv$ of $G$ such that $\{d_v(G), d_u(G)\} =…

math.CO2017

A bijection between bargraphs and Dyck paths

Emeric Deutsch, Sergi Elizalde

Bargraphs are a special class of convex polyominoes. They can be identified with lattice paths with unit steps north, east, and south that start at the origin, end on the $x$ -axis,…

math.CO2016

Statistics on bargraphs viewed as cornerless Motzkin paths

Emeric Deutsch, Sergi Elizalde

A bargraph is a self-avoiding lattice path with steps $U = (0, 1)$ , $H = (1, 0)$ and $D = (0, - 1)$ that starts at the origin and ends on the $x$ -axis, and stays strictly above the $x$ -axis…

math.CO2014★ 81 cited

M-Polynomial and Degree-Based Topological Indices

Emeric Deutsch, Sandi Klavžar

Let $G$ be a graph and let $m_{ij} (G)$ , $i, j \geq 1$ , be the number of edges $uv$ of $G$ such that ${d_{v} (G), d_{u} (G)} = {i, j}$ . The {\em $M$ -polynomial} of $G$ is introduced with…

math.CO2013

The Hosoya polynomial of distance-regular graphs

Emeric Deutsch, Juan A. Rodriguez-Velazquez

In this note we obtain an explicit formula for the Hosoya polynomial of any distance-regular graph in terms of its intersection array. As a consequence, we obtain a very simple for…