828 search results - page 1 / 166 » Simplicial Powers of Graphs |
80
Voted
COCOA
2008
Springer
15 years 20 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...
COMBINATORICS
1999
14 years 10 months ago
1999
Abstract. Ehrenborg and Steingr
73
Voted
DM
2002
14 years 10 months ago
2002
We consider the vertex-isoperimetric problem for cartesian powers of a graph G. A total order on the vertex set of G is called isoperimetric if the boundary of sets of a given siz...
82
Voted
JSC
2007
14 years 10 months ago
2007
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
87
Voted
DM
2007
14 years 10 months ago
2007
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the inde...