We give necessary and sufficient conditions for a distance matrix to have a unicycfic graph as unique optimal graph realization.
Note on graphs and weakly cyclic matrices
✍ Scribed by E. Marques De Sá
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 816 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
The main result consists of a combinatorial characterization of weakly cyclic matrices of odd index. The case of even index is also considered.
📜 SIMILAR VOLUMES
## Abstract We show that all graphs with a simple extension property are projective. As a consequence of this result we settle in the affirmative a conjecture of Larose and Tardif and characterize all homogeneous graphs which are projective. © 2004 Wiley Periodicals, Inc. J Graph Theory 47: 81–86,
## dedicated to professor w. t. tutte on the occasion of his eightieth birtday It is known that the chromatic number of a graph G=(V, E) with V= [1, 2, ..., n] exceeds k iff the graph polynomial f G => ij # E, i<j (x i &x j ) lies in certain ideals. We describe a short proof of this result, using
## Abstract An application of conservative graphs to topological graph theory is indicated.
## Abstract Coset graphs are a generalization of Cayley graphs. They arise in the construction of graphs and digraphs with transitive automorphism groups. Moreover, the consideration of coset graphs makes it possible to give an algebraic description of regular connected graphs of even degree. In th