AbstractFor a tree T and an integer k⩾1, it is well known that the kth power Tk of T is strongly chordal and hence has a strong elimination ordering of its vertices. In this note we obtain a complete characterization of strongly simplicial vertices of Tk, thereby characterizing all strong elimination orderings of the vertices of Tk
We present here some results on particular elimination schemes for chordal graphs, namely we show th...
AbstractWe say that, for k≥2 and ℓ>k, a tree T with distance function dT(x,y) is a (k,ℓ)-leaf root o...
AbstractA chordal graph has a dominating clique iff it has diameter at most 3. A strongly chordal gr...
AbstractFor a tree T and an integer k⩾1, it is well known that the kth power Tk of T is strongly cho...
AbstractTotal graphs of trees were proved strongly chordal by Martin Farber. We give a new proof of ...
AbstractIn a graph, a vertex is simplicial if its neighborhood is a clique. For an integer k≥1, a gr...
AbstractIn this paper those graphs are studied for which a so-called strong ordering of the vertex s...
AbstractSeveral efficient algorithms have been proposed to construct a perfect elimination ordering ...
AbstractFor an undirected graph G the kth power Gk of G is the graph with the same vertex set as G w...
AbstractIn this paper, we present a simple charactrization of strongly chordal graphs. A chordal gra...
AbstractThe ‘strength’ of an edge or cycle is the number of maximal complete subgraphs it is in. Str...
Several efficient algorithms have been proposed to construct a perfect elimination ordering of the v...
AbstractThe class of doubly chordal graphs, which is a subclass of chordal graphs and a superclass o...
AbstractLet G = (V,E) be a finite undirected connected graph. We show that there is a common perfect...
A graph with p vertices is said to be strongly multiplicative if its vertices can be labelled 1,2,.....
We present here some results on particular elimination schemes for chordal graphs, namely we show th...
AbstractWe say that, for k≥2 and ℓ>k, a tree T with distance function dT(x,y) is a (k,ℓ)-leaf root o...
AbstractA chordal graph has a dominating clique iff it has diameter at most 3. A strongly chordal gr...
AbstractFor a tree T and an integer k⩾1, it is well known that the kth power Tk of T is strongly cho...
AbstractTotal graphs of trees were proved strongly chordal by Martin Farber. We give a new proof of ...
AbstractIn a graph, a vertex is simplicial if its neighborhood is a clique. For an integer k≥1, a gr...
AbstractIn this paper those graphs are studied for which a so-called strong ordering of the vertex s...
AbstractSeveral efficient algorithms have been proposed to construct a perfect elimination ordering ...
AbstractFor an undirected graph G the kth power Gk of G is the graph with the same vertex set as G w...
AbstractIn this paper, we present a simple charactrization of strongly chordal graphs. A chordal gra...
AbstractThe ‘strength’ of an edge or cycle is the number of maximal complete subgraphs it is in. Str...
Several efficient algorithms have been proposed to construct a perfect elimination ordering of the v...
AbstractThe class of doubly chordal graphs, which is a subclass of chordal graphs and a superclass o...
AbstractLet G = (V,E) be a finite undirected connected graph. We show that there is a common perfect...
A graph with p vertices is said to be strongly multiplicative if its vertices can be labelled 1,2,.....
We present here some results on particular elimination schemes for chordal graphs, namely we show th...
AbstractWe say that, for k≥2 and ℓ>k, a tree T with distance function dT(x,y) is a (k,ℓ)-leaf root o...
AbstractA chordal graph has a dominating clique iff it has diameter at most 3. A strongly chordal gr...