Topics
threshold graphSoftware
verticesBook
Abstract. We consider Schrodinger operators on threshold graphs and prove a formula for the Colin de Verdiere parameter in terms of the building sequence. We construct an optimal Colin de Verdiere matrix for each connected threshold graph G of n vertices. For a large subclass of threshold graphs we construct an alternative Colin de Verdiere matrix depending on a large parameter. As a corollary to this last construction, we give estimates on the size of the non-zero eigenvalues of this matrix. 1
We investigate hierarchies of semidefinite approximations for the chromatic number $\chi(G)$ of a gr...
This thesis focuses on the study of two graph parameters known as the Shannon capacity and the Lovás...
A graph G on n vertices is a threshold graph if there exist real numbers $$a:1,a_2, \ldots, a_n$$ an...
International audienceThe Colin de Verdière graph parameter $\mu(G)$ was introduced in 1990 by Y. Co...
AbstractIn this paper we study the Laplacian spectra, the Laplacian polynomials, and the number of s...
AbstractIn this paper we consider threshold graphs (also called nested split graphs) and investigate...
During the last three decades, different types of decompositions have been processed in the field of...
Abstract. We study the limit theory of large threshold graphs and apply this to a variety of models ...
The Colin de Verdi`ere parameters, μ and v, are defined to be the maximum nullity of certain real sy...
This thesis consists of four papers concerning topics in the spectral theory of quantum graphs, whic...
ABSTRACT During the last three decades, different types of decompositions have been processed in th...
A threshold graph on n vertices is coded by a binary string of length n − 1. We obtain a formula for...
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems...
In 1990, Y. Colin de Verdière introduced a new graph parameter µ(G), based on spectral properties of...
Let G be a threshold graph. In this paper, we give, in first hand, a formula relating the chromatic ...
We investigate hierarchies of semidefinite approximations for the chromatic number $\chi(G)$ of a gr...
This thesis focuses on the study of two graph parameters known as the Shannon capacity and the Lovás...
A graph G on n vertices is a threshold graph if there exist real numbers $$a:1,a_2, \ldots, a_n$$ an...
International audienceThe Colin de Verdière graph parameter $\mu(G)$ was introduced in 1990 by Y. Co...
AbstractIn this paper we study the Laplacian spectra, the Laplacian polynomials, and the number of s...
AbstractIn this paper we consider threshold graphs (also called nested split graphs) and investigate...
During the last three decades, different types of decompositions have been processed in the field of...
Abstract. We study the limit theory of large threshold graphs and apply this to a variety of models ...
The Colin de Verdi`ere parameters, μ and v, are defined to be the maximum nullity of certain real sy...
This thesis consists of four papers concerning topics in the spectral theory of quantum graphs, whic...
ABSTRACT During the last three decades, different types of decompositions have been processed in th...
A threshold graph on n vertices is coded by a binary string of length n − 1. We obtain a formula for...
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems...
In 1990, Y. Colin de Verdière introduced a new graph parameter µ(G), based on spectral properties of...
Let G be a threshold graph. In this paper, we give, in first hand, a formula relating the chromatic ...
We investigate hierarchies of semidefinite approximations for the chromatic number $\chi(G)$ of a gr...
This thesis focuses on the study of two graph parameters known as the Shannon capacity and the Lovás...
A graph G on n vertices is a threshold graph if there exist real numbers $$a:1,a_2, \ldots, a_n$$ an...
Add to ORKG