Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
graph cycles
Description:
Graph cycles are closed paths in graph theory that begin and end at the same vertex, with no repeated edges.
Primary topic:
Advanced Graph Theory Research (31%)
Related topics:
Advanced Graph Theory Research (31%),
Limits and Structures in Graph Theory (9%),
Complexity and Algorithms in Graphs (8%)
Wikidata ID:
wiki/Q245595
OpenAlex ID:
keywords/graph-cycles
Clustering and information in correlation based financial networks
2004
·
J.-P. Onnela
, K. Kaski
, et al.
·
The European Physical Journal B
·
426
PDF
On the maximal number of independent circuits in a graph
1963
·
K. Corrádi
, A. Hajnal
·
Acta Mathematica Academiae Scientiarum Hungaricae
·
390
Cyclic Railway Timetable Optimization
2003
·
Leon Peeters
·
EUR Research Repository (Erasmus University Rotterdam)
·
340
Fluctuation Theorem for Currents and Schnakenberg Network Theory
2007
·
David Andrieux
, Pierre Gaspard
·
Journal of Statistical Physics
·
273
PDF
New sufficient conditions for cycles in graphs
1984
·
Geng-Hua Fan
·
Journal of Combinatorial Theory Series B
·
230
PDF
Edge Agreement: Graph-Theoretic Performance Bounds and Passivity Analysis
2010
·
Daniel Zelazo
, Mehran Mesbahi
·
IEEE Transactions on Automatic Control
·
222
Cycle bases in graphs characterization, algorithms, complexity, and applications
2009
·
Telikepalli Kavitha
, Christian Liebchen
, et al.
·
Computer Science Review
·
215
Beziehungen zwischen den in einem Graphen enthaltenen Kreisen und seinem charakteristischen Polynom
2022
·
Horst Sachs
·
Publicationes Mathematicae Debrecen
·
199
Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
1998
·
Reuven Bar-Yehuda
, Dan Geiger
, et al.
·
SIAM Journal on Computing
·
197
Entanglement in coined quantum walks on regular graphs
2005
·
Ivens Carneiro
, Meng Loo
, et al.
·
New Journal of Physics
·
161
PDF
Speeding up the Floyd–Warshall algorithm for the cycled shortest path problem
2011
·
Asghar Aini
, Amir Salehipour
·
Applied Mathematics Letters
·
109
PDF
Improving Belief Propagation on Graphs With Cycles
2004
·
M.R. Yazdani
, S. Hemati
, et al.
·
IEEE Communications Letters
·
101
1Approximate evaluation of marginal association probabilities with belief propagation
·
Jason L. Williams
, Roslyn A. Lau
·
97
Über Kreise in Graphen
1974
·
Hansjoachim Walther
, Heinz‐Jürgen Voss
·
VEB Deutscher Verlag der Wissenschaften eBooks
·
95
Extremal problems for cycles in graphs
2016
·
Jacques Verstraëte
·
The IMA volumes in mathematics and its applications
·
94
Cycles and Connectivity in Graphs
1967
·
M. E. Watkins
, D. M. Mesner
·
Canadian Journal of Mathematics
·
93
PDF
Node-pancyclicity and edge-pancyclicity of crossed cubes
2004
·
Jianxi Fan
, Xiaola Lin
, et al.
·
Information Processing Letters
·
90
Maximal circuits of graphs. I
1976
·
D. R. Woodall
·
Acta Mathematica Academiae Scientiarum Hungaricae
·
90
Sufficient Conditions for the Existence of Zeno Behavior
2006
·
A.D. Ames
, A. Abate
, et al.
·
IEEE Conference on Decision and Control (CDC)
·
82
Algebraic geometrization of the Kuramoto model: Equilibria and stability analysis
2015
·
Dhagash Mehta
, Noah S. Daleo
, et al.
·
Chaos An Interdisciplinary Journal of Nonlinear Science
·
81
PDF
Union of all the Minimum Cycle Bases of a Graph
1997
·
Philippe Vismara
·
The Electronic Journal of Combinatorics
·
79
PDF
A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs
1966
·
John T. Welch
·
Journal of the ACM
·
76
PDF
Cycles and Bridges in Graphs. .
1991
·
Heinz‐Jürgen Voss
·
Kluwer Academic Publishers eBooks
·
75
Spectral structure of the Laplacian on a covering graph
2008
·
Yusuke Higuchi
, Yuji Nomura
·
European Journal of Combinatorics
·
72
PDF
Cycles through specified vertices
1993
·
B�la Bollob�s
, Graham Brightwell
·
COMBINATORICA
·
70
Show more works
View as search
Works count:
776
Citation count:
7,157
Year
Topic
Type