Keyword

graph connectivity

Description: A graph-theoretic property or measure describing how strongly a graph’s vertices are connected, often through paths or disconnections.

Primary topic: Advanced Graph Theory Research (35%)

Wikidata ID: wiki/Q72897900

OpenAlex ID: keywords/graph-connectivity

Random Geometric Graphs

2003 · Mathew Penrose · Oxford University Press eBooks · 2,479

Connectedness and binary branching

1984 · Richard S. Kayne · De Gruyter eBooks · 1,520

Topological properties of hypercubes

1988 · Y. Saad, M.H. Schultz · IEEE Transactions on Computers · 1,368

Graph Minors .XIII. The Disjoint Paths Problem

1995 · N. Robertson, P.D. Seymour · Journal of Combinatorial Theory Series B · 1,267

THE LAPLACIAN SPECTRUM OF GRAPHS y

1991 · Bojan Mohar · 1,085

Distributed Coordination Control of Multiagent Systems While Preserving Connectedness

2007 · Meng Ji, Magnus Egerstedt · IEEE Transactions on Robotics · 880

Congruent Graphs and the Connectivity of Graphs

1932 · Hassler Whitney · American Journal of Mathematics · 863

Algorithmic graph theory

1985 · Alan Gibbons · 835

Dividing a Graph into Triconnected Components

1973 · J. E. Hopcroft, R. E. Tarjan · SIAM Journal on Computing · 833

Edge-Disjoint Spanning Trees of Finite Graphs

1961 · C. St.J. A. Nash-Williams · Journal of the London Mathematical Society · 811

Congruent Graphs and the Connectivity of Graphs

1992 · Hassler Whitney · Birkhäuser Boston eBooks · 788

Random Graph Dynamics

2006 · Rick Durrett · Cambridge University Press eBooks · 785

On the strength of connectedness of a random graph

1964 · P. Erdős, A. Rényi · Acta Mathematica Academiae Scientiarum Hungaricae · 785

The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected

1983 · J. Scott Provan, Michael O. Ball · SIAM Journal on Computing · 733

MetaVelvet: an extension of Velvet assembler to de novo metagenome assembly from short sequence reads

2012 · Toshiaki Namiki, Tsuyoshi Hachiya, et al. · Nucleic Acids Research · 676

PDF

A note on Hamiltonian circuits

1972 · V. Chvátal, P. Erdös · Discrete Mathematics · 629

Connectivity in Graphs

1966 · W.T. Tutte · University of Toronto Press eBooks · 605

An O(logn) parallel connectivity algorithm

1982 · Yossi Shiloach, Uzi Vishkin · Journal of Algorithms · 596

A Textbook of Graph Theory

2000 · R. Balakrishnan, K. Ranganathan · Universitext · 584

Network Flow and Testing Graph Connectivity

1975 · Shimon Even, R. Endre Tarjan · SIAM Journal on Computing · 550

Implementing Discrete Mathematics: Combinatorics And Graph Theory With Mathematica

1990 · Steven Skiena · Medical Entomology and Zoology · 542

Stable flocking of mobile agents. II. Dynamic topology

2004 · H.G. Tanner, A. Jadbabaie, et al. · 527

An Efficient Parallel Biconnectivity Algorithm

1985 · Robert E. Tarjan, Uzi Vishkin · SIAM Journal on Computing · 525

Geometric Spanner Networks

2007 · Giri Narasimhan, Michiel Smid · Cambridge University Press eBooks · 510

Undirected connectivity in log-space

2008 · Omer Reingold · Journal of the ACM · 508

Works count: 11,430

Citation count: 127,900