Get started
Keyword

cycle graphs

Description: Cycle graphs are mathematical graphs whose vertices and edges form a single closed cycle, studied in graph theory.
Wikidata ID: wiki/Q622506
OpenAlex ID: keywords/cycle-graphs
The theory of stochastic processes
1966 · Athanasios Papoulis · Journal of the Franklin Institute · 686
Quantum walks on graphs
2001 · Dorit Aharonov, Andris Ambainis, et al. · ACM Symposium on Theory of Computing (STOC) · 638
Evolutionary games on cycles
2006 · Hisashi Ohtsuki, Martin A Nowak · Proceedings of the Royal Society B Biological Sciences · 231
The Rendezvous Search Problem
1995 · Steve Alpern · SIAM Journal on Control and Optimization · 227
On the Reachability and Observability of Path and Cycle Graphs
2011 · G. Parlangeli, G. Notarstefano · IEEE Transactions on Automatic Control · 223
Proposals for scoring and assessing the 100-HUE test
1970 · P.R. Kinnear · Vision Research · 173
On the Wiener index of a graph
1991 · Ante Graovac, Toma? Pisanski · Journal of Mathematical Chemistry · 155
On the metric dimension of corona product graphs
2011 · I.G. Yero, D. Kuziak, et al. · Computers & Mathematics with Applications · 145
Fast sorting by reversal
1996 · Piotr Berman, Sridhar Hannenhalli · Lecture notes in computer science · 131
Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs
2014 · Nima Monshizadeh, Shuo Zhang, et al. · IEEE Transactions on Automatic Control · 130
PDF
Graphs with large total domination number
2000 · Michael A. Henning · Journal of Graph Theory · 110
Perfect State Transfer in Quantum Walks on Graphs
2011 · Vivien M. Kendon, Christino Tamon · Journal of Computational and Theoretical Nanoscience · 109
Characterization of graphs using domination polynomials
2010 · Saieed Akbari, Saeid Alikhani, et al. · European Journal of Combinatorics · 98
PDF
A 3/2-approximation algorithm for sorting by reversals
1998 · David A. Christie · 98
Entropic Inequalities and Marginal Problems
2012 · Tobias Fritz, Rafael Chaves · IEEE Transactions on Information Theory · 96
PDF
Complexity of the VRP and SDVRP
2010 · Claudia Archetti, Dominique Feillet, et al. · Transportation Research Part C Emerging Technologies · 95
A quasi-PTAS for unsplittable flow on line graphs
2006 · Nikhil Bansal, Amit Chakrabarti, et al. · ACM Symposium on Theory of Computing (STOC) · 92
Pseudoinverse of the Laplacian and best spreader node in a network
2017 · P. Van Mieghem, K. Devriendt, et al. · Physical review. E · 91
PDF
Inverse Problems for Electrical Networks
2000 · Edward B Curtis, James A Morrow · Series on applied mathematics · 85
The Cartesian Product and Join Graphs on Edge-Version Atom-Bond Connectivity and Geometric Arithmetic Indices
2018 · Xiujun Zhang, Huiqin Jiang, et al. · Molecules · 84
PDF
Distributed control of angle-constrained cyclic formations using bearing-only measurements
2013 · Shiyu Zhao, Feng Lin, et al. · Systems & Control Letters · 81
Spectral characterizations of lollipop graphs
2008 · Willem H. Haemers, Xiaogang Liu, et al. · Linear Algebra and its Applications · 80
Continuous-time quantum walks on a cycle graph
2006 · Dmitry Solenov, Leonid Fedichkin · Physical Review A · 80
PDF
Controllability of multiagent systems based on path and cycle graphs
2017 · Xianzhu Liu, Zhijian Ji · International Journal of Robust and Nonlinear Control · 76
Complete solution to a conjecture on the maximal energy of unicyclic graphs
2011 · Bofeng Huo, Xueliang Li, et al. · European Journal of Combinatorics · 76
PDF
Works count: 3,400
Citation count: 14,360
Year
Topic
Type