
It was shown by \textit{J. A. Bondy} [Stud. Sci. Math. Hung. 4, 473-475 (1969; Zbl 0184.27702)] that if \(G\) is a graph of order \(n\) in which \(d_G(x) + d_G(y) \geq n\) for each pair of nonadjacent vertices \(x\) and \(y\) of \(G\), then \(G\) is either pancyclic or the complete bipartite graph \(K_{n/2,n/2}\). This result is generalized by proving a local version of the Bondy result. Let \(W\) be a set of at least \(3\) vertices of \(G\). It is shown that if \(d_G(x) + d_G(y) \geq n\) for each pair of nonadjacent vertices \(x\) and \(y\) of \(W\), then either for each \(i\) with \(3 \leq i \leq | W| \) there will be a cycle of \(G\) containing precisely \(i\) vertices of \(W\), or \(W = K_{2,2}\), or \(| W| = n\), and \(G = K_{n/2,n/2}\).
Eulerian and Hamiltonian graphs, Computational Theory and Mathematics, hamiltonian, pancyclic, Discrete Mathematics and Combinatorics, Paths and cycles, degree, Theoretical Computer Science
Eulerian and Hamiltonian graphs, Computational Theory and Mathematics, hamiltonian, pancyclic, Discrete Mathematics and Combinatorics, Paths and cycles, degree, Theoretical Computer Science
| selected citations These citations are derived from selected sources. 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). | 6 | |
| 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. | Average | |
| 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 |
