On the distance-regularity of odd graphs
2013
- 7Usage
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Metrics Details
- Usage7
- Abstract Views7
Thesis / Dissertation Description
This thesis is an exposition of a paper entitled An odd characterization of the gen- eralized odd graphs by Edwin R. Van Dam and Willem H. Haemers. The Spectral Excess Theorem states that a connected graph {u100000} is distance-regular if the average excess of {u100000} is equal to its spectral excess. This theorem was proven by Fiol and Garriaga in 1997. In this paper we use the Spectral Excess Theorem to show that any connected k-regular graph with d + 1 distinct eigenvalues and odd-girth 2d + 1 is distance-regular.
Bibliographic Details
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know