The Colin de Verdi`ere parameters, μ and v, are defined to be the maximum nullity of certain real symmetric matrices associated with a given graph. In this work, both of these parameters are calculated for all chordal graphs. For v the calculation is based solely on maximal cliques, while for μ the calculation depends on split subgraphs. For the case of μ our work extends some recent work on computing μ for split graphs
AbstractLet G=(V,E) be a graph with V={1,2,…,n}. Define S(G) as the set of all n×n real-valued symme...
In 1990, Y. Colin de Verdière introduced a new graph parameter µ(G), based on spectral properties of...
AbstractFor a given simple graph G, S(G) is defined to be the set of real symmetric matrices A whose...
The Colin de Verdi`ere parameters, μ and v, are defined to be the maximum nullity of certain real sy...
For a given undirected graph G, the minimum rankof G is defined to be the smallest possible rankover...
For a given undirected graph G, the minimum rankof G is defined to be the smallest possible rank ove...
AbstractFor a graph G=(V,E) with vertex-set V={1,2,…,n}, let S(G) be the set of all n×n real-valued ...
Tree-width, and variants that restrict the allowable tree decompositions, play an important role in ...
For a graph G=(V,E) with vertex-set V={1,2,…,n}, let be the set of all n×n real-valued symmetric mat...
Let G=(V,E) be a undirected graph containing n vertices, and let be the set of all Hermitian n×n mat...
Let G = (V,E) be a graph with V = {1, 2, ¿ ,n}, in which we allow parallel edges but no loops, and l...
AbstractLet μ(G) and ω(G) be the Colin de Verdière and clique numbers of a graph G, respectively. It...
Let G=(V,E) be a graph with V={1,2,…,n}. Define S(G) as the set of all n×n real-valued symmetric mat...
Abstract. We consider Schrodinger operators on threshold graphs and prove a formula for the Colin de...
AbstractWe present polynomial algorithms to locate minimum weight dominating sets and independent do...
AbstractLet G=(V,E) be a graph with V={1,2,…,n}. Define S(G) as the set of all n×n real-valued symme...
In 1990, Y. Colin de Verdière introduced a new graph parameter µ(G), based on spectral properties of...
AbstractFor a given simple graph G, S(G) is defined to be the set of real symmetric matrices A whose...
The Colin de Verdi`ere parameters, μ and v, are defined to be the maximum nullity of certain real sy...
For a given undirected graph G, the minimum rankof G is defined to be the smallest possible rankover...
For a given undirected graph G, the minimum rankof G is defined to be the smallest possible rank ove...
AbstractFor a graph G=(V,E) with vertex-set V={1,2,…,n}, let S(G) be the set of all n×n real-valued ...
Tree-width, and variants that restrict the allowable tree decompositions, play an important role in ...
For a graph G=(V,E) with vertex-set V={1,2,…,n}, let be the set of all n×n real-valued symmetric mat...
Let G=(V,E) be a undirected graph containing n vertices, and let be the set of all Hermitian n×n mat...
Let G = (V,E) be a graph with V = {1, 2, ¿ ,n}, in which we allow parallel edges but no loops, and l...
AbstractLet μ(G) and ω(G) be the Colin de Verdière and clique numbers of a graph G, respectively. It...
Let G=(V,E) be a graph with V={1,2,…,n}. Define S(G) as the set of all n×n real-valued symmetric mat...
Abstract. We consider Schrodinger operators on threshold graphs and prove a formula for the Colin de...
AbstractWe present polynomial algorithms to locate minimum weight dominating sets and independent do...
AbstractLet G=(V,E) be a graph with V={1,2,…,n}. Define S(G) as the set of all n×n real-valued symme...
In 1990, Y. Colin de Verdière introduced a new graph parameter µ(G), based on spectral properties of...
AbstractFor a given simple graph G, S(G) is defined to be the set of real symmetric matrices A whose...
DOI
Add to ORKG