More on Signed Graphs with at Most Three Eigenvalues

IF 0.5 4区数学 Q3 MATHEMATICS

Discussiones Mathematicae Graph Theory Pub Date : 2022-07-12 DOI:10.7151/dmgt.2393

F. Ramezani, P. Rowlinson, Z. Stanić

引用次数: 6

Abstract

Abstract We consider signed graphs with just 2 or 3 distinct eigenvalues, in particular (i) those with at least one simple eigenvalue, and (ii) those with vertex-deleted subgraphs which themselves have at most 3 distinct eigenvalues. We also construct new examples using weighing matrices and symmetric 3-class association schemes.

查看原文本刊更多论文

更多关于最多三个特征值的签名图

摘要我们考虑只有2或3个不同特征值的签名图，特别是(i)那些至少有一个简单特征值的签名图，和(ii)那些顶点删除子图本身最多有3个不同特征值的签名图。我们还利用加权矩阵和对称的3类关联方案构造了新的例子。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Discussiones Mathematicae Graph Theory MATHEMATICS-

CiteScore

2.20

自引率

0.00%

发文量

审稿时长

53 weeks

期刊介绍： The Discussiones Mathematicae Graph Theory publishes high-quality refereed original papers. Occasionally, very authoritative expository survey articles and notes of exceptional value can be published. The journal is mainly devoted to the following topics in Graph Theory: colourings, partitions (general colourings), hereditary properties, independence and domination, structures in graphs (sets, paths, cycles, etc.), local properties, products of graphs as well as graph algorithms related to these topics.