Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 229,666,043 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
2010
Highly Cited
2010
On H-supermagic labelings for certain shackles and amalgamations of a connected graph
T. K. Maryati
,
A. Salman
,
E. Baskoro
,
J. Ryan
,
Mirka Miller
2010
Corpus ID: 61322926
Highly Cited
2009
Highly Cited
2009
Chordality and hyperbolicity of a graph
Yaokun Wu
,
Chengpeng Zhang
2009
Corpus ID: 115171573
Let $G$ be a connected graph with the usual shortest-path metric $d$. The graph $G$ is $\delta$-hyperbolic provided for any…
Expand
2007
2007
Weakly Connected Oscillatory Network Models for Associative and Dynamic Memories
F. Corinto
,
M. Bonnin
,
M. Gilli
International Journal of Bifurcation and Chaos in…
2007
Corpus ID: 40499407
Several studies in neuroscience have shown that nonlinear oscillatory networks represent bio-inspired models for information and…
Expand
Highly Cited
2004
Highly Cited
2004
Study of Connectivity in Wireless Ad-hoc Networks with an Improved Radio Model
R. Hekmat
2004
Corpus ID: 16799754
In this paper we study connectivity in wireless ad-hoc networks by modeling the network as an undirected geometric random graph…
Expand
2002
2002
Radio antipodal colorings of graphs
G. Chartrand
,
D. Erwin
,
Ping Zhang
2002
Corpus ID: 32589631
A radio antipodal coloring of a connected graph $G$ with diameter $d$ is an assignment of positive integers to the vertices of $G…
Expand
Highly Cited
2000
Highly Cited
2000
Simulated annealing based approach to PSS and FACTS based stabilizer tuning
M. A. Abido
2000
Corpus ID: 110423858
Highly Cited
1999
Highly Cited
1999
Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks
D. Gamarnik
Symposium on the Theory of Computing
1999
Corpus ID: 8286849
We investigate the stability of packet routing policies in adversarial queueing networks. We provide a simple classification of…
Expand
1984
1984
An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter
U. Schumacher
Networks
1984
Corpus ID: 28744566
Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this…
Expand
Highly Cited
1979
Highly Cited
1979
Enumeration of All Minimal Cut-Sets for a Node Pair in a Graph
S. Arunkumar
,
S. Lee
IEEE Transactions on Reliability
1979
Corpus ID: 33397751
This paper presents an efficient implicit enumeration algorithm for generating all minimal cut-sets separating a specified node…
Expand
Highly Cited
1970
Highly Cited
1970
Nonlinear Regression With Linear Constraints: An Extension of the Magnified Diagonal Method
R. Shrager
JACM
1970
Corpus ID: 19170775
A syntax-directed picture analysis system based on a formal picture description scheme is described. The system accepts a…
Expand
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