Results 1 
2 of
2
A Characterization Of Graphs With Interval Squares
, 1993
"... . The competition graph of a symmetric digraph D with a loop at each vertex is the square of the underlying graph of D with loops removed. In the interest of efficiently assigning radio frequencies in a communication network, we would like to determine which graphs have interval squares. Necessary a ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
. The competition graph of a symmetric digraph D with a loop at each vertex is the square of the underlying graph of D with loops removed. In the interest of efficiently assigning radio frequencies in a communication network, we would like to determine which graphs have interval squares. Necessary
Akademisk avhandling för teknisk doktorsexamen vid
, 1994
"... mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where the group ..."
Abstract
 Add to MetaCart
of the thesis can be summarized as follows. • We prove that for all Coxeter graphs constructed from an npath of unlabelled edges by adding a new labelled edge and a new vertex (sometimes two new edges and vertices), there is a permutational representation of the corresponding group. Group elements correspond