5 search results - page 1 / 1 » Strongly simplicial vertices of powers of trees |
81
Voted
DM
2007
14 years 10 months ago
2007
For a tree T and an integer k ≥ 1, it is well known that the k-th power T k of T is strongly chordal and hence has a strong elimination ordering of its vertices. In this note we...
COCOA
2008
Springer
15 years 4 days ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
ISCAS
2005
IEEE
15 years 3 months ago
2005
IEEE
: Assume that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive integer, called a supply or a demand. Each demand vertex can receive ...
JDA
2008
14 years 10 months ago
2008
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...