Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,147,103 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.
2013
2013
Extremal Unicyclic and Bicyclic Graphs with Respect to Harary Index
Kexiang Xu
2013
Corpus ID: 6538439
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. In this…
Expand
2011
2011
Decompositions of graphs into a given clique-extension
Teresa Sousa
Ars Comb.
2011
Corpus ID: 17411452
For r ≥ 3, a clique-extension of order r + 1 is a connected graph that consists of a Kr plus another vertex adjacent to at most r…
Expand
Review
2003
Review
2003
A Survey and Performance Evaluation of Scalable Tree-based Application Layer Multicast Protocols
Su-Wei Tan
,
A. Waters
,
J. Crawford
2003
Corpus ID: 13925385
Application layer multicast (ALM) enables rapid deployment of multicast applications in the Internet. In ALM, application hosts…
Expand
2000
2000
An Adaptive Systems Approach to the Implementation and Evaluation of Digital Library Recommendation Systems
J. Bollen
,
Luis Mateus Rocha
European Conference on Research and Advanced…
2000
Corpus ID: 31324116
The focus for information retrieval systems in digital libraries has shifted from passive repositories of information to…
Expand
Highly Cited
2000
Highly Cited
2000
Improving the Up ∗ /Down ∗ Routing Scheme for Networks of Workstations (cid:1)
J. Sancho
,
A. Robles
2000
Corpus ID: 27872345
. Networks of workstations (NOWs) are being considered as a cost-effective alternative to parallel computers. Many NOWs are…
Expand
1995
1995
ON THE PERIOD-TWO-PROPERTY OF THE MAJORITY OPERATOR IN INFINITE GRAPHS
G. Moran
1995
Corpus ID: 46283692
A self-mapping M : X —» X of a nonempty set X has the Period- Two-Property (p2p) if M2x = x holds for every Af-periodic point x e…
Expand
1992
1992
An improvement of fraisse's sufficient condition for hamiltonian graphs
A. Ainouche
Journal of Graph Theory
1992
Corpus ID: 5169027
Let G be a k-connected graph of order n. For an independent set c, let d(S) be the number of vertices adjacent to at least one…
Expand
Highly Cited
1991
Highly Cited
1991
Constructing multidimensional spanner graphs
Jeffrey S. Salowe
International journal of computational geometry…
1991
Corpus ID: 43353023
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…
Expand
1986
1986
Trajectory nets connecting all critical points of a smooth function
I. Diener
Mathematical programming
1986
Corpus ID: 206818765
The disconnected components of certain trajectory nets containing all critical points of a differentiable functionf can be…
Expand
1984
1984
Discrete ordered sets whose covering graphs are median
H. Bandelt
1984
Corpus ID: 121123265
As is well known the covering graph ( = Hasse diagram) of any median semilattice is a median graph, and every median graph is the…
Expand