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.
Highly Cited
2010
Highly Cited
2010
On H-supermagic labelings for certain shackles and amalgamations of a connected graph
Highly Cited
2009
Highly Cited
2009
Chordality and hyperbolicity of a graph
Let $G$ be a connected graph with the usual shortest-path metric $d$. The graph $G$ is $\delta$-hyperbolic provided for any… 
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… 
2003
2003
A maximum flow algorithm using MA ordering
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
2000
Highly Cited
2000
Simulated annealing based approach to PSS and FACTS based stabilizer tuning
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… 
Highly Cited
1999
Highly Cited
1999
The forcing geodetic number of a graph
For two vertices u and v of a graph G, the set I(u, v) consists of all vertices lying on some u − v geodesic in G. If S is a set… 
Highly Cited
1991
Highly Cited
1991
Constructing multidimensional spanner graphs
Given a connected graph G=(V,E) with positive edge weights, define the distance dG(u,v) between vertices u and v to be the length… 
1987
1987
On the number of minimum size separating vertex sets in a graph and how to find all of them
Abstract : Connectivity is an important graph property and there has been a considerable amount of work on vertex connectivity of… 
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)