Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs
Copyright policy ) Jeno Lehel; Kiyoshi Yoshimoto; Ralph J. Faudree;
Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs
Let G be a simple $$m\times m$$m×m bipartite graph with minimum degree $$\delta (G)\ge m/2+1$$?(G)?m/2+1. We prove that for every pair of vertices x, y, there is a Hamiltonian cycle in G such that the distance between x and y along that cycle equals k, where $$2\le k
- Alfréd Rényi Institute of Mathematics Hungary
- University of Memphis United States
- Hungarian Academy of Sciences Hungary
- Nihon University Japan
- Nihon Bunka University Japan
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).1 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).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
citations
Citations provided by BIP!
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).
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 1
Average
Average
Average
Fields of Science
This action will publish the selected files and record in Zenodo. Are you sure you want to proceed?