Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,238,164 papers from all fields of science
Search
Sign In
Create Free Account
Connectivity (graph theory)
Known as:
Connected (Graph Theory)
, Strongly-connected digraph
, Disconnected graph
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Adjacency matrix
Algebraic connectivity
Apollonian network
Argus - Audit Record Generation and Utilization System
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
Fundus Image Classification Using VGG-19 Architecture with PCA and SVD
Muhammad Mateen
,
Junhao Wen
,
Nasrullah
,
Sun Song
,
Zhouping Huang
Symmetry
2018
Corpus ID: 67771517
Automated medical image analysis is an emerging field of research that identifies the disease with the help of imaging technology…
Expand
Highly Cited
2013
Highly Cited
2013
Dynamic graph connectivity in polylogarithmic worst case time
B. M. Kapron
,
Valerie King
,
Ben Mountjoy
ACM-SIAM Symposium on Discrete Algorithms
2013
Corpus ID: 1110229
The dynamic graph connectivity problem is the following: given a graph on a fixed set of n nodes which is undergoing a sequence…
Expand
2010
2010
Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
O. Suil
,
S. Cioabă
SIAM Journal on Discrete Mathematics
2010
Corpus ID: 15974264
In this paper, we study the relationship between eigenvalues and the existence of certain subgraphs in regular graphs. We give a…
Expand
Highly Cited
2007
Highly Cited
2007
A particle-swarm-based approach of power system stability enhancement with unified power flow controller
A. Al-Awami
,
Y. Abdel-Magid
,
M. A. Abido
2007
Corpus ID: 20223204
Highly Cited
2006
Highly Cited
2006
The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
Jun Sun
,
Stephen P. Boyd
,
Lin Xiao
,
P. Diaconis
SIAM Review
2006
Corpus ID: 6249579
We consider a Markov process on a connected graph, with edges labeled with transition rates between the adjacent vertices. The…
Expand
Highly Cited
2004
Highly Cited
2004
On the controllability of nearest neighbor interconnections
H. Tanner
IEEE Conference on Decision and Control
2004
Corpus ID: 8065105
In this paper we derive necessary and sufficient conditions for a group of systems interconnected via nearest neighbor rules, to…
Expand
Highly Cited
2003
Highly Cited
2003
Deterministic Rendezvous in Graphs
Anders Dessmark
,
P. Fraigniaud
,
D. Kowalski
,
A. Pelc
Algorithmica
2003
Corpus ID: 22236305
Two mobile agents having distinct identifiers and located in nodes of an unknown anonymous connected graph, have to meet at some…
Expand
Highly Cited
2002
Highly Cited
2002
Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks
E. Lloyd
,
Rui Liu
,
M. Marathe
,
R. Ramanathan
,
S. Ravi
ACM Interational Symposium on Mobile Ad Hoc…
2002
Corpus ID: 7031488
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power…
Expand
Highly Cited
2001
Highly Cited
2001
Distributed topology construction of Bluetooth personal area networks
Theodoros Salonidis
,
P. Bhagwat
,
L. Tassiulas
,
R. LaMaire
Proceedings IEEE INFOCOM . Conference on Computer…
2001
Corpus ID: 17160656
Wireless ad hoc networks have been a growing area of research. While there has been considerable research on the topic of routing…
Expand
Highly Cited
1984
Highly Cited
1984
The Multi-Tree Approach to Reliability in Distributed Networks
A. Itai
,
M. Rodeh
Information and Computation
1984
Corpus ID: 2365054
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)
ACCEPT & CONTINUE