Keyword

connected graphs

Description: A connected graph is a graph in which every pair of vertices is joined by a path, studied in graph theory and combinatorics.

Primary topic: Graph theory and applications (33%)

Wikidata ID: wiki/Q230655

OpenAlex ID: keywords/connected-graphs

A note on two problems in connexion with graphs

1959 · E. W. Dijkstra · Numerische Mathematik · 24,330

Automating the design of graphical presentations of relational information

1986 · Jock Mackinlay · ACM Transactions on Graphics · 1,611

PDF

Extended Bayesian Information Criteria for Gaussian Graphical Models

2010 · Foygel, Rina, Drton, Mathias · arXiv (Cornell University) · 811

PDF

Quantized consensus

2007 · Akshay Kashyap, Tamer Başar, et al. · Automatica · 754

The theory of stochastic processes

1966 · Athanasios Papoulis · Journal of the Franklin Institute · 686

On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I

1962 · S. L. Hakimi · Journal of the Society for Industrial and Applied Mathematics · 644

Dynamic Event-Triggered and Self-Triggered Control for Multi-agent Systems

2018 · Xinlei Yi, Kun Liu, et al. · IEEE Transactions on Automatic Control · 551

Systematic Solution of Multiparticle Scattering Problems

1964 · Steven Weinberg · Physical Review · 391

Innovation and robustness in complex regulatory gene networks

2007 · S. Ciliberti, O. C. Martin, et al. · Proceedings of the National Academy of Sciences · 362

Random walks on graphs

1974 · F. Göbel, A.A. Jagers · Stochastic Processes and their Applications · 247

A note on finding the bridges of a graph

1974 · R.Endre Tarjan · Information Processing Letters · 222

Interconnection topologies for multi-agent coordination under leader–follower framework

2009 · Zhijian Ji, Zidong Wang, et al. · Automatica · 204

PDF

The geodetic number of a graph

1993 · Frank Harary, Emmanuel Loukakis, et al. · Mathematical and Computer Modelling · 202

Spanning Trees with Many Leaves

1991 · Daniel J. Kleitman, Douglas B. West · SIAM Journal on Discrete Mathematics · 199

Zero forcing parameters and minimum rank problems

2010 · Francesco Barioli, Wayne Barrett, et al. · Linear Algebra and its Applications · 193

PDF

On optimal completion of incomplete pairwise comparison matrices

2010 · Sándor Bozóki, János Fülöp, et al. · Mathematical and Computer Modelling · 193

On the existence of a factor of degree one of a connected random graph

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

Divergence of perturbation theory for bosons

1965 · Arthur Jaffe · Communications in Mathematical Physics · 176

Domination in graphs with minimum degree two

1989 · William McCuaig, Bruce Shepherd · Journal of Graph Theory · 172

Analytic combinatorics of non-crossing configurations

1999 · Philippe Flajolet, Marc Noy · Discrete Mathematics · 165

PDF

A Sharp Upper Bound of the Spectral Radius of Graphs

2001 · Yuan Hong, Jin-Long Shu, et al. · Journal of Combinatorial Theory Series B · 164

Two Algorithms for Generating Weighted Spanning Trees in Order

1977 · Harold N. Gabow · SIAM Journal on Computing · 154

On the information rate of perfect secret sharing schemes

1995 · Marten Van Dijk · Designs Codes and Cryptography · 150

On graphs having domination number half their order

1985 · J. F. Fink, M. S. Jacobson, et al. · Periodica Mathematica Hungarica · 144

A table of connected graphs on six vertices

1984 · Dragoš Cvetković, Milenko Petrić · Discrete Mathematics · 141

Works count: 3,380

Citation count: 56,140