Max-plus objects to study the complexity of graphs

Cristiano Bocci, Luca Chiantini, Fabio Rapallo

Published 2011-11-05, updated 2011-11-08Version 2

Given an undirected graph $G$, we define a new object $H_G$, called the mp-chart of $G$, in the max-plus algebra. We use it, together with the max-plus permanent, to describe the complexity of graphs. We show how to compute the mean and the variance of $H_G$ in terms of the adjacency matrix of $G$ and we give a central limit theorem for $H_G$. Finally, we show that the mp-chart is easily tractable also for the complement graph.