Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ARSCOM
1998

favoriteEmaildiscussreport

79views more ARSCOM 1998»

A characterization of halved cubes

13 years 4 months ago

A characterization of halved cubes

Download www.fmf.uni-lj.si

The vertex set of a halved cube Qd consists of a bipartition vertex set of a cube Qd and two vertices are adjacent if they have a common neighbour in the cube. Let d ≥ 5. Then it is proved that Qd is the only connected, d 2 -regular graph on 2d−1 vertices in which every edge lies in two d-cliques and two d-cliques do not intersect in a vertex.

Wilfried Imrich, Sandi Klavzar, Aleksander Vesel

Real-time Traffic

ARSCOM 1998 | Bipartition Vertex | Cube Qd | Halved Cube Qd |

claim paper

Related Content

» Partial cubes structures characterizations and constructions

» On Geometric Dilation and Halving Chords

» Characterization of Hierarchies and Some Operators in OLAP Environment

» Recognizing Graphs of Acyclic Cubical Complexes

» HighDimensional OLAP A Minimal Cubing Approach

» On translation invariant operators which preserve the Bspline recurrence

» Characterization of a Faulttolerant NoC Router

» The Class of Simple CubeCurves Whose MLPs Cannot Have Vertices at Grid Points

» Mining multiplelevel fuzzy blocks from multidimensional data

Post Info
More Details (n/a)

Added	21 Dec 2010
Updated	21 Dec 2010
Type	Journal
Year	1998
Where	ARSCOM
Authors	Wilfried Imrich, Sandi Klavzar, Aleksander Vesel

Comments (0)