A near-polygonal graph is a graph which has a set C of m-cycles for some positive integer m such that each 2-path of is contained in exactly one cycle in C. If m is the girth of then the graph is called polygonal. Given a polygonal graph of valency r and girth m, Archdeacon and Perkel proved the exi
A note on the construction of marked graphs
โ Scribed by K. Thirusangu; K. Rangarajan
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 318 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract A marked graph is obtained from a graph by giving each point either a positive or a negative sign. Beineke and Harary raised the problem of characterzing consistent marked graphs in which the product of the signs of the points is positive for every cycle. In this paper a characterizatio
This note provides counter-examples to a conjecture of D.A. Holton on stability of graphs. It is shown that even though the automorphism groups of two graphs are identical, one may be stable while the other is not.
## Abstract An application of conservative graphs to topological graph theory is indicated.