It can easily be seen that a conjecture of RUNGE does not hold for a class of graphs whose members will be called "almost regular". This conjecture is replaced by a weaker one, and a classification of almost regular graphs is given.
A Note on A Family of Directed Strongly Regular Graphs
β Scribed by Sylvia A. Hobart; T. Justin Shaw
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 54 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract We prove that there is an absolute constant __C__>0 so that for every natural __n__ there exists a triangleβfree __regular__ graph with no independent set of size at least \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle
## Abstract Lower bounds on the size of a maximum bipartite subgraph of a triangleβfree __r__βregular graph are presented.
We give counterexamples to two conjectures of Bill Jackson in Some remarks on arc-connectivity, vertex splitting, and orientation in graphs and digraphs (Journal of Graph Theory 12(3):429-436, 1988) concerning orientations of mixed graphs and splitting off in digraphs, and prove the first conjecture