The complement of the path is determined by its spectrum
- Doob, Michael
- Haemers, Willem H.
DOIAbstract
AbstractIt is proved that a graph whose (0,1)-adjacency matrix has the spectrum of Pn, the complement of the path on n vertices, must be Pn
AbstractIt is proved that a graph whose (0,1)-adjacency matrix has the spectrum of Pn, the complement of the path on n vertices, must be Pn
AbstractMethods of Coxeter groups are used to prove recent results about the solutions of the matrix...
AbstractThis paper presents a variety of results on graph spectra. The number of main eigenvalues of...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
AbstractIt is proved that a graph whose (0,1)-adjacency matrix has the spectrum of Pn, the complemen...
AbstractLet Knm denote the graph obtained by attaching m pendent edges to a vertex of complete graph...
AbstractIt is proved that graph Zn is determined by its adjacency spectrum as well as its Laplacian ...
AbstractThe lollipop graph, denoted by Hn,p, is obtained by appending a cycle Cp to a pendant vertex...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
AbstractA ∞-graph B(r,s) is a graph consisting of two cycles Cr+1 and Cs+1 with just a vertex in com...
AbstractThe graph Cn1∇Kk is the product of a circuit Cn1 and a clique Kk. In this paper, we will pro...
For almost all graphs the answer to the question in the title is still unknown. Here we survey the c...
Cographs, also known as complement reducible graphs or decomposable graphs, are a recursively define...
AbstractThe minimum number of complete bipartite subgraphs needed to partition the edges of a graph ...
AbstractLet Tnc be the set of the complements of trees of order n. In this paper, we characterize th...
AbstractMethods of Coxeter groups are used to prove recent results about the solutions of the matrix...
AbstractThis paper presents a variety of results on graph spectra. The number of main eigenvalues of...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
AbstractIt is proved that a graph whose (0,1)-adjacency matrix has the spectrum of Pn, the complemen...
AbstractLet Knm denote the graph obtained by attaching m pendent edges to a vertex of complete graph...
AbstractIt is proved that graph Zn is determined by its adjacency spectrum as well as its Laplacian ...
AbstractThe lollipop graph, denoted by Hn,p, is obtained by appending a cycle Cp to a pendant vertex...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
AbstractA ∞-graph B(r,s) is a graph consisting of two cycles Cr+1 and Cs+1 with just a vertex in com...
AbstractThe graph Cn1∇Kk is the product of a circuit Cn1 and a clique Kk. In this paper, we will pro...
For almost all graphs the answer to the question in the title is still unknown. Here we survey the c...
Cographs, also known as complement reducible graphs or decomposable graphs, are a recursively define...
AbstractThe minimum number of complete bipartite subgraphs needed to partition the edges of a graph ...
AbstractLet Tnc be the set of the complements of trees of order n. In this paper, we characterize th...
AbstractMethods of Coxeter groups are used to prove recent results about the solutions of the matrix...
AbstractThis paper presents a variety of results on graph spectra. The number of main eigenvalues of...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
Add to ORKG