An explicit formula for the distance characteristic polynomial of threshold graphs

Autor:	Lazzarin, Joao, Marquez, Oscar F., Tura, Fernando C.
Rok vydání:	2018
Předmět:	Mathematics - Combinatorics
Druh dokumentu:	Working Paper
Popis:	A threshold graph G on n vertices is defined by binary sequence of length n. In this paper we present an explicit formula for computing the distance characteristic polynomial of a threshold graph from its binary sequence. As application, we show a several of nonisomorphic pairwise threshold graphs which are {D}-cospectral graphs.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1811.03061 Zobrazit plný text záznamu View this record from Arxiv