828 search results - page 2 / 166 » Simplicial Powers of Graphs |
DM
2007
13 years 7 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...
JGAA
2006
13 years 7 months ago
2006
Three classes of graphs, simplicial, upper bound, and middle graphs, have been known for some time, but many of their algorithmic properties have not been published. The definitio...
DAM
1998
13 years 7 months ago
1998
In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to...
MA
2010
Springer
13 years 5 months ago
2010
Springer
Global depth, tangent depth and simplicial depths for classical and orthogonal regression are compared in examles and properies that are usefull for calculations are derived. Algo...
IPPS
2003
IEEE
14 years 22 days 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...