SOME ODD GRAPH THEORY

@article{Biggs1979SOMEOG,
  title={SOME ODD GRAPH THEORY},
  author={N. Biggs},
  journal={Annals of the New York Academy of Sciences},
  year={1979},
  volume={319}
}
  • N. Biggs
  • Published 1979
  • Mathematics
  • Annals of the New York Academy of Sciences
A simple and fast heuristic algorithm for edge-coloring of graphs
TLDR
A simple but empirically ecient heuristic algorithm for the edge-coloring of graphs that displaces ‘conicts’ along paths of adjacent vertices whose incident edges are recolored by swapping alternating colors. Expand
Recursive Relationships in the Classes of Odd Graphs and Middle Levels Graphs
The classes of odd graphs $O_n$ and middle levels graphs $B_n$ form one parameter subclasses of the Kneser graphs and bipartite Kneser graphs respectively. In particular both classes are vertexExpand
Odd Graphs Are Prism-Hamiltonian and Have a Long Cycle
TLDR
It is shown that the prism over O k is hamiltonian and that O k has a cycle with .625|V(O k )| vertices at least. Expand
Optimal Independent Spanning Trees on Odd Graphs
TLDR
A construction algorithm of ISTs on odd graphs is shown, and it is analyzed that all the lengths of the paths in the ISTs are less than or equal to the length of the shortest path+4, which is optimal. Expand
On Twisted Odd Graphs
TLDR
These twisted odd graphs are examples of the so-called boundary graphs, which are graphs satisfying an extremal property that arises from a bound for the diameter of a graph in terms of its distinct eigenvalues. Expand
EIGENVALUE INTERLACING AND WEIGHT PARAMETERS OF GRAPHS
Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relationExpand
Connectivity concerning the last two subconstituents of a Q-polynomial distance-regular graph
TLDR
It is proved that the subgraph induced on the union of the last two subconstituents of $\Gamma$ with respect to $\gamma$ is connected. Expand
Strong edge colorings of graphs and the covers of Kneser graphs
A proper edge coloring of a graph is strong if it creates no bichromatic path of length three. It is well known that for a strong edge coloring of a k-regular graph at least 2k−1 colors are needed.Expand
On Some Properties of Middle Cube Graphs and their Spectra
In this research paper we begin with study of family of n dimensional hyper cube graphs and establish some properties related to their distance, spectra, and multiplicities and associated eigenExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 10 REFERENCES
An improved version of Lloyd's theorem
The generalisation of Lloyd's theorem to distance-transitive graphs can be improved in the case of antipodal graphs by looking at the derived graph. In the case of binary perfect codes the roots ofExpand
The rugby footballers of croam
Abstract The vertices of the graph O 8 are indexed by the 7-subsets of a 15-set. Two vertices are adjacent if and only if their labeling sets are disjoint. This paper demonstrates a HamiltonianExpand
DESIGNS, FACTORS AND CODES IN GRAPHS
Perfect codes in the graphs Ok
In this paper we consider the existence of perfect codes in the infinite class of distance-transitive graphs Ok. Perfect 1-codes correspond to certain Steiner systems and necessary conditions for theExpand
Perfect codes in graphs
Abstract The classical problem of the existence of perfect codes is set in a vector space. In this paper it is shown that the natural setting for the problem is the class of distance-transitiveExpand
The footballers of Croam
Abstract The vertices of the graph O k are indexed by the ( k −1)-subsets of a (2 k −1)-set. Two vertices are adjacent if and only if their labelling sets are disjoint. This paper establishes that OExpand
An Edge-Colouring Problem
Graphs with maximal even girth
INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
2. Notation The letters a, b, c, d, x, y, z denote finite sets of non-negative integers, all other lower-case letters denote non-negative integers. If fc I, then [k, I) denotes the setExpand