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.
Highly Cited
2018
Highly Cited
2018
Automated medical image analysis is an emerging field of research that identifies the disease with the help of imaging technology… 
Highly Cited
2013
Highly Cited
2013
The dynamic graph connectivity problem is the following: given a graph on a fixed set of n nodes which is undergoing a sequence… 
2010
2010
In this paper, we study the relationship between eigenvalues and the existence of certain subgraphs in regular graphs. We give a… 
Highly Cited
2006
Highly Cited
2006
We consider a Markov process on a connected graph, with edges labeled with transition rates between the adjacent vertices. The… 
Highly Cited
2004
Highly Cited
2004
In this paper we derive necessary and sufficient conditions for a group of systems interconnected via nearest neighbor rules, to… 
Highly Cited
2003
Highly Cited
2003
Two mobile agents having distinct identifiers and located in nodes of an unknown anonymous connected graph, have to meet at some… 
Highly Cited
2002
Highly Cited
2002
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power… 
Highly Cited
2001
Highly Cited
2001
Wireless ad hoc networks have been a growing area of research. While there has been considerable research on the topic of routing…