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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. In this… 
Highly Cited
2009
Highly Cited
2009
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
In this paper we study connectivity in wireless ad-hoc networks by modeling the network as an undirected geometric random graph… 
2002
2002
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
We investigate the stability of packet routing policies in adversarial queueing networks. We provide a simple classification of… 
Highly Cited
1999
Highly Cited
1999
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
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…