On the Distance Cospectrality of Threshold Graphs

Zhenzhen Lou , Jianfeng Wang , Qiongxiang Huang

CSIAM Trans. Appl. Math. ›› 2022, Vol. 3 ›› Issue (2) : 335 -350.

PDF (51KB)
CSIAM Trans. Appl. Math. ›› 2022, Vol. 3 ›› Issue (2) : 335 -350. DOI: 10.4208/csiam-am.SO-2021-0005
research-article

On the Distance Cospectrality of Threshold Graphs

Author information +
History +
PDF (51KB)

Abstract

A threshold graph can be represented as the binary sequence. In this paper, we present an explicit formula for computing the distance characteristic polynomial of a threshold graph from its binary sequence, and then give a necessary and sufficient condition to characterize two distance cospectral but non-isomorphic threshold graphs. As its applications, we obtain many families of distance cospectral threshold graphs. This provides a negative answer to the problem posed in [22].

Keywords

Threshold graph / distance matrix / spectrum / characteristic polynomial

Cite this article

Download citation ▾
Zhenzhen Lou, Jianfeng Wang, Qiongxiang Huang. On the Distance Cospectrality of Threshold Graphs. CSIAM Trans. Appl. Math., 2022, 3(2): 335-350 DOI:10.4208/csiam-am.SO-2021-0005

登录浏览全文

4963

注册一个新账户 忘记密码

References

AI Summary AI Mindmap
PDF (51KB)

124

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/