
<script type="text/javascript">
<!--
document.write('<div id="oa_widget"></div>');
document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=undefined&type=result"></script>');
-->
</script>The author proves the following theorem: Let \(G\) be a connected non- complete regular graph of valency \(d\) and let \(\lambda\) be the maximum of the absolute values of the eigenvalues of \(G\) distinct from \(d\). Then the toughness \(t\) of \(G\) satisfies \(t> d/\lambda- 2\).
Extremal problems in graph theory, Numerical Analysis, Algebra and Number Theory, Graphs and linear algebra (matrices, eigenvalues, etc.), eigenvalues, toughness, Discrete Mathematics and Combinatorics, Geometry and Topology
Extremal problems in graph theory, Numerical Analysis, Algebra and Number Theory, Graphs and linear algebra (matrices, eigenvalues, etc.), eigenvalues, toughness, Discrete Mathematics and Combinatorics, Geometry and Topology
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 30 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
