An explicit formula for the distance characteristic polynomial of threshold graphs

Joao Lazzarin; Oscar F. Marquez; Fernando C. Tura

An explicit formula for the distance characteristic polynomial of threshold graphs

Combinatorics 2018-11-08 v1

Authors: Joao Lazzarin , Oscar F. Marquez , Fernando C. Tura

Abstract

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.

Keywords

threshold graph distance characteristic polynomial binary sequence explicit formula d-cospectral graphs

Cite

@article{arxiv.1811.03061,
  title  = {An explicit formula for the distance characteristic polynomial of threshold graphs},
  author = {Joao Lazzarin and Oscar F. Marquez and Fernando C. Tura},
  journal= {arXiv preprint arXiv:1811.03061},
  year   = {2018}
}