# 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
• Mathematics, Computer Science
• ArXiv
• 2012
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
• Mathematics, Computer Science
• LATIN
• 2014
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
• Computer Science
• The Journal of Supercomputing
• 2009
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
• Computer Science, Mathematics
• Combinatorics, Probability and Computing
• 2000
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
• Mathematics, Computer Science
• J. Comb. Theory, Ser. A
• 2021
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
• Mathematics
• 2021
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
• 2020
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