Q-integral graphs with at most two vertices of degree greater than or equal to three

被引：2

作者：

Novanta, Anderson Fernandes ^{[1
]}

de Lima, Leonardo ^{[2
]}

Oliveira, Carla Silva ^{[3
]}

机构：

[1] Colegio Pedro II, Rua Dr Manoel Reis 501, BR-25025010 Duque De Caxias, RJ, Brazil

[2] Univ Fed Parana, Dept Adm Geral & Aplicada, Av Prefeito Lothario Meissner,2 Andar, BR-80210170 Curitiba, Parana, Brazil

[3] Escola Nacl Ciencias Estat, Rua Andre Cavalcanti 106, BR-20231050 Bairro De Fatima, RJ, Brazil

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 2021年 / 614卷 / 614期

关键词：

Signless Laplacian matrix; Eigenvalues; Q-integral graphs;

D O I：

10.1016/j.laa.2020.03.027

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let G a graph on n vertices. The signless Laplacian matrix of G, denoted by Q(G), is defined as Q(G) = D(G) + A(G), where A(G) is the adjacency matrix of G and D(G) is the diagonal matrix of the degrees of G. A graph G is said to be Q-integral if all eigenvalues of the matrix Q(G) are integers. In this paper, we characterize all Q-integral graphs among all connected graphs with at most two vertices of degree greater than or equal to three. (C) 2020 Elsevier Inc. All rights reserved.

引用

页码：144 / 163

页数：20

共 50 条

[31] EMBEDDING PSEUDO-COMPLEMENTS OF QUADRICS IN PG(N,Q), N-GREATER-THAN-OR-EQUAL-TO-3, Q-GREATER-THAN-OR-EQUAL-TO-2
BATTEN, LM
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1988, 49 (02) : 338 - 348
[32] Cayley graphs of diameter two with order greater than 0.684 of the Moore bound for any degree
Abas, Marcel
EUROPEAN JOURNAL OF COMBINATORICS, 2016, 57 : 109 - 120
[33] Degree ten manifolds of dimension n greater than or equal to 3
Fania, ML
Livorni, EL
MATHEMATISCHE NACHRICHTEN, 1997, 188 : 79 - 108
[34] CONTRACTILE EDGES IN N-CONNECTED GRAPHS WITH MINIMUM DEGREE GREATER THAN OR EQUAL TO [5N/4]
EGAWA, Y
GRAPHS AND COMBINATORICS, 1991, 7 (01) : 15 - 21
[35] Contractible Edges in a 4-Connected Graph with Vertices of Degree Greater Than Four
Kiyoshi Ando
Yoshimi Egawa
Graphs and Combinatorics, 2007, 23 : 99 - 115
[36] Contractible edges in a 4-connected graph with vertices of degree greater than four
Ando, Kiyoshi
Egawa, Yoshimi
GRAPHS AND COMBINATORICS, 2007, 23 (Suppl 1) : 99 - 115
[37] LINEAR GRAPHS OF DEGREE LESS-THAN-OR-EQUAL-TO 6 AND THEIR GROUPS
KAGNO, IN
AMERICAN JOURNAL OF MATHEMATICS, 1946, 68 (03) : 505 - 520
[38] COMPUTER GENERATION OF ALL 1-FACTORS FOR A CLASS OF GRAPHS WITH ALL VERTICES OF DEGREE TWO OR THREE.
Knop, J.V.
Szymanski, K.
Trinajstic, N.
Krivka, P.
Computers & mathematics with applications, 1984, 10 (4-5): : 369 - 382
[39] Number of vertices of degree three in spanning 3-trees in square graphs
Aye, Win Min
Tian, Tao
Xiong, Liming
APPLIED MATHEMATICS AND COMPUTATION, 2019, 357 : 258 - 262
[40] DEGREE-9 MANIFOLDS OF DIMENSION GREATER-THAN OR EQUAL TO 3
FANIA, ML
LIVORNI, EL
MATHEMATISCHE NACHRICHTEN, 1994, 169 : 117 - 134

← 1 2 3 4 5 →