Skip to search formSkip to main contentSkip to account menu

Connectivity (graph theory)

Known as: Connected (Graph Theory), Strongly-connected digraph, Disconnected graph 
In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Adjacency matrixAlgebraic connectivityApollonian networkArgus - Audit Record Generation and Utilization System

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Reactive power control strategy of DFIG wind farms for regulating voltage of power grid
If a wind farm is weakly connected to a power grid, then the voltage of the connection point fluctuates frequently due to the… 
2007
2007
Weakly Connected Oscillatory Network Models for Associative and Dynamic Memories
Several studies in neuroscience have shown that nonlinear oscillatory networks represent bio-inspired models for information and… 
2005
2005
Cuts leaving components of given minimum order
Highly Cited
2004
Highly Cited
2004
Wiener index of zig-zag polyhex nanotubes
A method for deriving formulas for evaluating the sum of all distances, known as the Wiener index, of the »zig-zag« nanotubes is… 
Highly Cited
2004
Highly Cited
2004
Study of Connectivity in Wireless Ad-hoc Networks with an Improved Radio Model
In this paper we study connectivity in wireless ad-hoc networks by modeling the network as an undirected geometric random graph… 
2002
2002
Radio antipodal colorings of graphs
A radio antipodal coloring of a connected graph $G$ with diameter $d$ is an assignment of positive integers to the vertices of $G… 
Highly Cited
1999
Highly Cited
1999
Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks
We investigate the stability of packet routing policies in adversarial queueing networks. We provide a simple classification of… 
1996
1996
First and second order diffusive methods for rapid, coarse, distributed load balancing (extended abstract)
We consider the following general problem modeling load balancing in a variety of distributed settings. Given an arbitrary… 
1984
1984
An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter
Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this… 
Highly Cited
1979
Highly Cited
1979
Enumeration of All Minimal Cut-Sets for a Node Pair in a Graph
This paper presents an efficient implicit enumeration algorithm for generating all minimal cut-sets separating a specified node… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)